ka-weihe/fastest-levenshtein

Damerau–Levenshtein distance?

Closed this issue · 3 comments

leeoniya commented

hi @ka-weihe,

does/can this implementation treat transposition as a single-cost op?

https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance

ka-weihe commented

No, this implementation is not Damerau. However, the implementation can be changed to measure the Damerau Levenshtein distance instead, but that is not the scope of this package. I may create a separate package for Damerau Levenshtein in the future, but it will never be a part of this package.

BeLi4L commented

I'm also interested in a Damereau-Levenshtein variant. How would you adapt the existing algorithm for that? 🤔

Besides, do you have any explanation/documentation/resource to explain the current "Myers 32/X" algorithms?

  • 👍1
ka-weihe commented

'm also interested in a Damereau-Levenshtein variant. How would you adapt the existing algorithm for that? thinking

A Damereau-Levenshtein variant would be trivial. I'll probably make another repo for that (soon).

Besides, do you have any explanation/documentation/resource to explain the current "Myers 32/X" algorithms?

No