There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
A enhanced version of edit distance (Levenshtein distance) algorithm, which extract detail difference between two strings instead of only cost hinted. The algorithm can be used in change detection, dynamic planning, even typewriting exercise.
