Returns an integer that is the number of single-character inserts, deletes, or substitutions that would be required to change startString to endString. Useful for indexing and fuzzy search applications. The algorithm is described in Wikipedia <seealso href="https://en.wikipedia.org/wiki/Levenshtein_distance"/>