fuzzy_compareversion

Fastest bounded Levenshtein comparator over generic structures

This library does not calculate the edit distance.

Rather, it provides extremely efficient automata that answer whether 2 values are within a predetermined number of edits of one another. Edits are: additions, deletions, replacements.

Once generated, an automaton can be reused to compare any 2 values in around 2-8 ┬Ás.

AuthorSimon Grondin
LicenseMIT
Published
Homepagehttps://github.com/SGrondin/fuzzy_compare
Issue Trackerhttps://github.com/SGrondin/fuzzy_compare/issues
MaintainerSimon Grondin
Dependencies
Source [http] https://github.com/SGrondin/fuzzy_compare/archive/2.0.0.tar.gz
md5=3e82d5ab12f1cdb93e0fbae1f386f5bf
sha512=9c43989323872380b60cb593715214e37190efa6b663fbed9264aaafc0dceed5419cfd858c6e6cafdfa60a1c4ee2ccea6a408bb6f3cd7500dbea081725ba9c25
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/fuzzy_compare/fuzzy_compare.2.0.0/opam
No package is dependent