Abstract: A novel technique for matching, merging, and combining a new database record with a master database record is described herein. The technique uses specific fields to compare in a unique exact match and fuzzy match combination to determine if a non-exact matching record pair is indeed a matched pair. Once the match is established, the records are merged or combined to utilize the best information from the two records.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a string similarity score determined using a Levenshtein distance algorithm, the n-gram or trigram methods, the Jaro-Winkler algorithm, the Cosine similarity algorithm, the Hamming distance algorithm, the Damerau-Levenshtein distance algorithm, or similar. For each comparison, the string similarity score is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches. The keyboard distance is determined by counting a number of key movements required to move from one key to another using diagonal movements.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a string similarity score determined using a Levenshtein distance algorithm, the n-gram or trigram methods, the Jaro-Winkler algorithm, the Cosine similarity algorithm, the Hamming distance algorithm, the Damerau-Levenshtein distance algorithm, or similar. For each comparison, the string similarity score is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a string similarity score determined using a Levenshtein distance algorithm, the n-gram or trigram methods, the Jaro-Winkler algorithm, the Cosine similarity algorithm, the Hamming distance algorithm, the Damerau-Levenshtein distance algorithm, or similar. For each comparison, the string similarity score is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a Levenshtein distance algorithm. For each comparison, the Levenshtein distance is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a Levenshtein distance algorithm. For each comparison, the Levenshtein distance is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a Levenshtein distance algorithm. For each comparison, the Levenshtein distance is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a Levenshtein distance algorithm. For each comparison, the Levenshtein distance is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a Levenshtein distance algorithm. For each comparison, the Levenshtein distance is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a Levenshtein distance algorithm. For each comparison, the Levenshtein distance is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.

Abstract: A targeted product distribution system is described herein with respect to an exemplary management of product flow through a distribution center. Specifically, the system and method described herein is directed to the management and display of direct and easily-understood instructions, such that average individuals, as well as those with mental disabilities, will be able to contribute equally to the overall process.