package levenshtein

You can search for identifiers within the package.

in-package search v0.2.0

package levenshtein

levenshtein
- Levenshtein
  - Array
  - Cache
  - CacheByHashtbl
    
    H
  - Make
    
    A
  - MakeWithCache
    
    A
    
    C
  - S
  - String
  - StringWithHashtbl
  - WithCache

Legend:
Library
Module
Module type
Parameter
Class
Class type

Simple implementation without cache

type t

val distance : ?upper_bound:int -> t -> t -> int

Calculate Levenshtein distance between two t's.

If we are only interested in the distance if it is smaller than some threshold, specifying upper_bound greatly improves the performance. In that case, the return value is always is culled to upper_bound.