Damerau-Levenshtein algorithm implementation for Crystal language.
Add it to Projectfile
deps do
github "suxxes/damerau-levenshtein"
end
require "damerau-levenshtein"
DamerauLevenshtein.distance("string", "string")
Implement "B. Boehmer, T. Rees, Modified Damerau-Levenshtein Distance", if required.
- Fork it (https://github.com/suxxes/damerau-levenshtein/fork)
- Create your feature branch (git checkout -b my-new-feature)
- Commit your changes (git commit -am 'Add some feature')
- Push to the branch (git push origin my-new-feature)
- Create a new Pull Request
- suxxes (https://github.com/suxxes) Fedor Suprychev - creator, maintainer