Universal deterministic Levenshtein automata imitation.
Implemented in accordance with Schulz and Mihov's "Fast String Correction with Levenshtein-Automata" (2002)
Spellchecker implemented in accordance with refined FB-Trie algorithm - Mihov and Schulz "Fast Approximate Search in Large Dictionaries" (2004)
Parametric descriptions precalculated for edit distances 1 and 2 with transpositions
Implemented in C#
You can find detailed description in russian here: https://habr.com/en/post/275937/