14 lines
375 B
Plaintext
14 lines
375 B
Plaintext
|
= Damerau-Levenshtein =
|
||
|
|
|
||
|
|
Damerau-Levenshtein distance is a metric measuring the edit distance between
|
||
|
|
two strings. It provides the minimum number of operations required to transform
|
||
|
|
one string to another, via
|
||
|
|
|
||
|
|
* insertion
|
||
|
|
* deletion
|
||
|
|
* substitution
|
||
|
|
* transposition
|
||
|
|
|
||
|
|
Many algorithms prefer to ignore the transpositons aspect of this problem, as
|
||
|
|
it adds signgficant complexity.
|