WOLFRAM|DEMONSTRATIONS PROJECT

Edit Distance

​
first word
embarrassment
second word
harass
distance method
Levenshtein
0
1
2
3
4
5
6
7
8
9
10
11
12
13
1
1
2
3
4
5
6
7
8
9
10
11
12
13
2
2
2
3
3
4
5
6
7
8
9
10
11
12
3
3
3
3
4
3
4
5
6
7
8
9
10
11
4
4
4
4
3
4
4
4
5
6
7
8
9
10
5
5
5
5
4
4
5
5
4
5
6
7
8
9
6
6
6
6
5
5
5
6
5
4
5
6
7
8
Two types of edit distance quantify the cost to transform between two strings. The Hamming distance gives the number of disagreements between words, usually of the same length. The Levenshtein distance is the number of one-element changes (adding, deleting, or substituting) needed to go from one word to the other.