Levenshtein distance
A metric in computer science measuring the minimum number of single-character edits (insertions, deletions, substitutions) required to change one string into another.
Levenshtein distance is used to measure the similarity between strings.
I calculated the Levenshtein distance between the two words using this algorithm.