LevenshteinAutomaton

Namespace

Rowles.LeanLucene.Codecs.Fst

Assembly

Rowles.LeanLucene.dll

Levenshtein DFA accepting strings within edit distance maxEdits of a reference term. Built via NFA-to-DFA subset construction at construction time to correctly handle deletions (ε-transitions that advance position without consuming input). Operates on UTF-8 bytes.

public sealed class LevenshteinAutomaton : IAutomaton

LevenshteinAutomaton

Implements

IAutomaton

LevenshteinAutomaton(ReadOnlySpan<byte>, int)

Initialises a new LevenshteinAutomaton from a raw UTF-8 byte representation of the term.

LevenshteinAutomaton(string, int)

Initialises a new LevenshteinAutomaton for the given term and maximum edit distance.

Start

Initial state of the automaton.

CanMatch(int)

Returns true if the automaton could potentially accept any string starting from the given state. Used for early pruning during intersection. Returns false only if the state is dead (no path to any accept state).

IsAccept(int)

Returns true if the given state is an accepting state.

Step(int, byte)

Transition function: returns next state given current state and input byte, or -1 if no transition.