The Levenshtein distance algorithm is probably what you are looking for. It measures the minimum number of transformations (insertions, deletions or substitutions) needed to turn one word into...