Skip to main content

Questions tagged [damerau-levenshtein]

For questions related to Damerau–Levenshtein. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one word into the other.

Filter by
Sorted by
Tagged with
10 votes
2 answers

Levenshtein Distance vs Damerau Levenstein vs Optimal String Alignment Distance

Could anyone explain in simple words (and maybe with an example) what the difference between the Levenshtein Distance, Damerau Levenstein, and Optimal String Alignment Distance? When would one use one ...
Thalassophile's user avatar