package spelll
Fuzzy string searching, using Levenshtein automaton. Can be used for spell-checking.
Install
dune-project
Dependency
Authors
Maintainers
Sources
0.2.tar.gz
sha256=bb189bc9f70d2409a2cc06112b6bd0862b6743042cef931bbb550df3d0add1ba
md5=dbe46f10969efba4b84882ba14001c1b
doc/spelll/Spelll/Make/index.html
Module Spelll.Make
Parameters
Signature
type char_ = Str.char_type string_ = Str.tEdit Distance
Edition distance between two strings. This satisfies the classical distance axioms: it is always positive, symmetric, and satisfies the formula distance a b + distance b c >= distance a c
Automaton
An automaton, built from a string s and a limit n, that accepts every string that is at distance at most n from s.
Build an automaton from a string, with a maximal distance limit. The automaton will accept strings whose edit_distance to the parameter is at most limit.
Build an automaton from a list, with a maximal distance limit
val debug_print :
(out_channel -> char_ -> unit) ->
out_channel ->
automaton ->
unitOutput the automaton's structure on the given channel.
match_with a s matches the string s against a, and returns true if the distance from s to the word represented by a is smaller than the limit used to build a
Index for one-to-many matching
module Index : sig ... end