spelll

Fuzzy string searching, using Levenshtein automaton
README

Fuzzy string searching, using Levenshtein automaton. Can be used for spell-checking.

API documentation can be found here,
and the source code here.

Some examples:

# #require "spelll";;
# let dfa = Spelll.of_string ~limit:1 "hello";;
val dfa : Spelll.automaton = <abstr>
# Spelll.match_with dfa "hell";;
- : bool = true
# Spelll.match_with dfa "hall";;
- : bool = false
# let idx = Spelll.Index.of_list ["hello", "world"; "hall", "vestibule"];;
val idx : string Spelll.Index.t = <abstr>
# Spelll.Index.retrieve_l idx ~limit:1 "hell" ;;
- : string list = ["world"; "vestibule"]
# Spelll.Index.retrieve_l idx ~limit:1 "hall" ;;
- : string list = ["vestibule"]

License

This software is free, under the BSD-2 license. See the LICENSE file.

Build

You only need OCaml (>= 4.02 should be enough) and dune and seq. Type

$ make
$ make install
Install
Published
23 Mar 2019
Sources
v0.3.tar.gz
md5=d07f33370540c0fe0ba3c8e0112299cf
sha512=5ba25cf300538bcb27bd63f272f001114b0f07a7fe45d287d33d13261d6c366ee59f897867d76fcabc898efd7ac400b598cb445f11051db7cb1448448f3a4020
Dependencies
odoc
with-doc
mdx
with-test
qcheck
with-test
dune
< "3.0"
Reverse Dependencies