Description

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.

Published: 28 Nov 2022

Dependencies (5)

  1. uunf with-test
  2. uuseg with-test
  3. core >= "v0.15.0"
  4. dune >= "1.9.0"
  5. ocaml >= "4.10.0"

Reverse Dependencies

    None

Conflicts

    None
Fastest bounded Levenshtein comparator over generic structures

Install

Documentation github.com Readme MIT License Edit opam file

Authors

  1. S
    Simon Grondin

Maintainers

  1. S
    Simon Grondin

Sources

2.0.0.tar.gz
md5=3e82d5ab12f1cdb93e0fbae1f386f5bf
sha512=9c43989323872380b60cb593715214e37190efa6b663fbed9264aaafc0dceed5419cfd858c6e6cafdfa60a1c4ee2ccea6a408bb6f3cd7500dbea081725ba9c25