About this tool
Measure how different two strings are using the Levenshtein edit distance and a similarity score. The calculation runs in your browser.
Frequently asked questions
What is edit distance?
It is the minimum number of single-character insertions, deletions or substitutions needed to turn one string into the other.
How is similarity computed?
Similarity is 1 minus the distance divided by the longer string's length, shown as a percentage.