package mula

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Universal Levenshtein Automata for OCaml strings

mula
- Mula
  - Match
    
    Make
    
    Dem
    
    Lev
    
    St
    
    S
  - Strings
    
    Dem
    
    Lev
mula.internal
- Internal
  - BitVec
  - DFA
    
    Make
    
    DFA
    
    NFA
    
    State
    
    StateSet
    
    Transitions
    
    NFAStateSetMap
    
    NFAStateSetSet
    
    Transitions
  - DemarauBVNFA
    
    StateSet
    
    Transitions
  - DemarauNFA
    
    State
    
    StateSet
    
    Transitions
  - LevBVNFA
    
    StateSet
    
    Transitions
  - LevNFA
    
    State
    
    StateSet
    
    Transitions
  - Matcher
    
    Make
    
    GBV
    
    NFA
    
    StateSet
    
    Transitions
    
    St
    
    NFA_t
    
    StateSet
    
    Transitions
    
    S
  - NFA
    
    NFA_t
    
    State
    
    StateSet
    
    Transitions
  - StringOps
    
    BitVecOps
    
    St
    
    S

Legend:
Library
Module
Module type
Parameter
Class
Class type

Universal Levenshtein Automata for OCaml strings

We provide two kinds of Automata:

Lev, for the standard Levenshtein distance.
Dem, for the Demarau-Levenshtein distance which includes transpositions as a primitve edit operation.

module Lev : sig ... end

module Dem : sig ... end