14 · Levenshtein Automata

Stop asking about two known strings. Build a recognizer for every string within N edits.

Which strings are within N edits of my query? Answered by Levenshtein automaton (NFA determinized to a DFA).

In this lab: Build the automaton, feed it terms character by character, and watch dead states kill candidates early.

loading mind map…

building the index…