Class LevenshteinAutomata

Class to construct DFAs that match a word within some edit distance.

Implements the algorithm described in: Schulz and Mihov: Fast String Correction with Levenshtein Automata

@lucene.experimental

Inheritance
System.Object
LevenshteinAutomata
Assembly: DistributedLucene.Net.dll
Syntax
public class LevenshteinAutomata : object

Constructors

Name Description
LevenshteinAutomata(Int32[], Int32, Boolean)

Expert: specify a custom maximum possible symbol (alphaMax); default is MAX_CODE_POINT.
LevenshteinAutomata(String, Boolean)

Create a new LevenshteinAutomata for some input string. Optionally count transpositions as a primitive edit.

Fields

Name Description
MAXIMUM_SUPPORTED_DISTANCE

@lucene.internal

Methods

Name Description
ToAutomaton(Int32)

Compute a DFA that accepts all strings within an edit distance of n.

All automata have the following properties:

  • They are deterministic (DFA).
  • There are no transitions to dead states.
  • They are not minimal (some transitions could be combined).

Extension Methods