Levenshtein Distance Calculator

Enter your source and target strings and click the ‘Calculate’ button to calculate the Levenshtein distance.




Levenshtein Distance


Levenshtein distance between two strings is the number of substitutions, deletions and insertions required to transform the source string into the target string.
For example, the Levenshtein distance between “cake” and “asked” is 3:
1. cake -> aake (substitution of “a” for “c”)
2. aake -> aske (substitution of “s” for “a”)
3. aske -> asked (insertion of “d” at the end)