1. A computer-implemented method comprising: calculating a Levenshtein matrix of a first string and a second string; determining a Levenshtein distance from said Levenshtein matrix; determining a largest common substring from said Levenshtein matrix; and automating at least one of data entry, processing or reporting for a database based upon said Levenshtein distance and said largest common substring, the database including at least one of said first or second strings.