1. A computer-implemented method comprising: calculating, by a processor of the computer, a Levenshtein matrix of a first string and a second string; determining a Levenshtein distance from said Levenshtein matrix; determining a longest diagonal of equal hamming distance within the Levenshtein matrix; determining a substring corresponding to the longest diagonal within said Levenshtein matrix, the substring being the largest common substring of the first and second strings; calculating a Levenshtein score as a function of said Levenshtein distance; calculating a largest common substring score as a function of said largest common substring; storing at least one of: the Levenshtein matrix, the Levenshtein distance, the largest common substring, the Levenshtein score, and the largest common substring score in a computer-readable storage medium; determining a similarity between said first string and said second string as a function of said Levenshtein score and said largest common substring score; and based upon said similarity, automating at least one of data entry for a database, processing within a database, or reporting from a database, the database including at least one of said first or second strings.