package spelll

  1. Overview
  2. Docs
package spelll
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module type Spelll.SSource

Sourcetype char_
Sourcetype string_
Edit Distance
Sourceval edit_distance : string_ -> string_ -> int

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.

Sourcetype automaton

Levenshtein automaton

Sourceval of_string : limit:int -> string_ -> automaton

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.

Sourceval of_list : limit:int -> char_ list -> automaton

Build an automaton from a list, with a maximal distance limit

Sourceval debug_print : (out_channel -> char_ -> unit) -> out_channel -> automaton -> unit

Output the automaton's structure on the given channel.

Sourceval match_with : automaton -> string_ -> bool

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
Sourcemodule Index : sig ... end