Problem 2309. Calculate the Damerau-Levenshtein distance between two strings.
i am facing a problem with ur test suite 5. is it correct?
even the built-in matlab function 'edit distance' is giving the result 3.
which i believe is the correct one.
if i am not wrong, according to demarau algorithm - here transposition will not occur.
Test case #5 is correct, Asif. If you want, you can try it on wolfram alpha using DamerauLevenshteinDistance['abc','ca']. Be careful, because the algorithm from wikipedia has errors.
Another example that should return 2 via Damerou-Levenshtein and 3 via Levenshtein alone: 'jellyfish' and 'jellyifhs'.
The algorithm given by Wikipedia is correct, I think, but take note that the first algorithm Wikipedia gives does not actually compute the Damerau-Levenshtein distance, but rather a related metric. Confusing, but the entry says as much if you read it closely.
Problem Recent Solvers22
Find the peak 3n+1 sequence value
Project Euler: Problem 2, Sum of even Fibonacci
More from this Author40
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!