package mula

  1. Overview
  2. Docs

Parameters

module St : S

Signature

Levenshtein Automata

Given a string representation, we produce two 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