• → EditDistance

DamerauLevenshteinDistance

WMA link

DamerauLevenshteinDistance[a, b]

returns the Damerau-Levenshtein distance of a and b, which is defined as the minimum number of
transpositions, insertions, deletions and substitutions needed to transform one into the other.
In contrast to EditDistance, DamerauLevenshteinDistance counts transposition of adjacent items (e.g.
“ab” into “ba”) as one operation of change.

• • DamerauLevenshteinDistance["kitten", "kitchen"]

• • DamerauLevenshteinDistance["abc", "ac"]

• • DamerauLevenshteinDistance["abc", "acb"]

• • DamerauLevenshteinDistance["azbc", "abxyc"]

The IgnoreCase option makes DamerauLevenshteinDistance ignore the case of letters:

• • DamerauLevenshteinDistance["time", "Thyme"]

• • DamerauLevenshteinDistance["time", "Thyme", IgnoreCase -> True]

DamerauLevenshteinDistance also works on lists:

• • DamerauLevenshteinDistance[{1, E, 2, Pi}, {1, E, Pi, 2}]