Computer scienceAlgorithms and Data StructuresAlgorithmsString algorithmsString similarity

Damerau–Levenshtein distance

Indices and values

Report a typo

Compare the values of the indices $i, j$ with the corresponding values of the Damerau-Levenshtein function:

Match the items from left and right columns

i, j > 0

and

a_i = b_j

i, j >0

and

a_i \neq b_j

i = j = 0

i, j > 0

and

a_i = b_j-1

and

a_i-1 = b_j

j > 0

i > 0

d(i - 1, j - 1)

d(i - 1, j - 1) + 1

d(i - 1, j) + 1

0

d(i - 2, j - 2)+1

d(i, j - 1) + 1

___

Create a free account to access the full topic