v1.0.2
An efficient, tabulated implementation of the Levenshtein distance algorithm used to compute the edit distance between two strings.
Current section
1 Dependant
⚡ Fast full-text search for Elixir
Published about 1 year ago
mix.exs
rebar.config
Gleam
erlang.mk
this version
4 784
yesterday
0
last 7 days
56
all time
5 026
Last Updated
Jul 18, 2024
License
Apache-2.0
Build Tools
Publisher
