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.
| Author | Simon Grondin |
|---|---|
| License | MIT |
| Published | |
| Homepage | https://github.com/SGrondin/fuzzy_compare |
| Issue Tracker | https://github.com/SGrondin/fuzzy_compare/issues |
| Maintainer | Simon Grondin |
| Dependencies | |
| Source [http] | https://github.com/SGrondin/fuzzy_compare/archive/refs/tags/2.0.1.tar.gz md5=90ba5dd28b12af0bb795f6bdbca34deb sha512=7550a654b200d82eac9ccdc58bb21627e29ff78bb9f0b06dd75b7aeb3960f58b42632b6836ce09103b29f254fb628bab5418e0e34f08a79833c7e01c3709b094 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/fuzzy_compare/fuzzy_compare.2.0.1/opam |
No package is dependent
