SpellChecker using Minimal Acyclic Finite-State Automata
Spell checker with autocomplete features final project made for Natural Language Processing class at FMI. Scrapped. Not completed.
-
Notifications
You must be signed in to change notification settings - Fork 0
hero101/SpellChecker
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
SpellChecker using Minimal Acyclic Finite-State Automata
Resources
Stars
Watchers
Forks
Releases
No releases published