-
Notifications
You must be signed in to change notification settings - Fork 51
Closed
Labels
Description
Library of efficient implementations of various string metric algorithms. I couldn't find library that implements Damerau-Levenshtein algorithm efficiently, so I decided to write one myself. Here are some others functions to calculate Levenshtein distance and Hamming distance. There will be more of them in the future.
I found package 'levenshtein' in Quicklisp that implements single function to calculate Levenshtein distance, but it is naïf and inefficient.
'vas-string-metrics' is better and quite usable, but it has no function to calculate Damerau-Levenshtein distance. Also, my implementation for Levenshtein distance is a little-little bit faster and uses less space, (tested with CLisp and SBCL).