type char_ = Str.char_type string_ = Str.tEdition 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
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 :
(Pervasives.out_channel -> char_ -> unit) ->
Pervasives.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
module Index : sig ... end