vickumar1981/stringdistance

Add Damerau variation of Levenshtein

vickumar1981 opened this issue · 1 comments

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

Damerau is a variation of Levenshtein where transposition is included as an operation. Normal levenshtein accounts for additions, removals, and substitutions of characters. damerau is additions, removals, substitutions, and transpositions. the upper bound on the damerau distance is the levenshtein distance, and correspondingly the lower bound on the damerau similarity score is the levenshtein similarity score.

Addressed by PR: #12

Will be testable by using the 1.0.7-SNAPSHOT.