Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
2 answers
609 views

Edit distance implementation

This problem is taken from the book Introduction to Algorithms, Third Edition By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein: In order to transform one source string ...
MAG's user avatar
  • 2,974
1 vote
1 answer
2k views

Levenshtein distance with edit sequence and alignment in Java

I have this program that computes a Levenshtein distance of the two input strings, their edit sequence, and the alignment: LevenshteinEditDistance.java: ...
coderodde's user avatar
  • 31k