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.

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/1.0.0.tar.gz
md5=455dc4fbe810bffb087b84ab638994fc
sha512=52d41e9686b77206dd3b9efdfef3c9511cb8a66927af7548ee5454258232a7f1e3aeb1106ae49f75bc3d04dada962a58ed8e2cfcd5d902f0d5465357dd3541dd
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/fuzzy_compare/fuzzy_compare.1.0.0/opam
No package is dependent