The Levenshtein edit distance between two strings is
the number of individual single-character changes (insert, delete,
substitute) necessary to change string
This can be a used to order search results, for fuzzy auto-completion, and to find candidates for spelling correction.
Returns the edit distance between strings