| Name |
Description |
| AutomatonState |
Automaton state. |
| LevTAutomataImitation |
Universal deterministic Levenshtein automaton for Damerau-Levenshtein distance |
| ParametricDescription |
This class stores precompiled transition tables for universal deterministic Levenshtein automata (with transpositions) Tables are stored as a static fields Supported edit distances N are 1 and 2 |
| SpellChecker |
Spell Checker uses the Levenshtein automaton and FB-Trie algorithm to find possible corrections for the given garbled word |
| SpellChecker.SpellCheckerState |
Search state |
| Trie |
Prefix tree |
| TrieNode |
Prefix tree node |