Applications of finite automata representing large vocabularies
Algorithms & Data Structures
Theory & Foundations
Machine Learning & AI
Programming Languages & Compilers
Databases
Abstract
<jats:title>Abstract</jats:title><jats:p>The construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and advisers, multilanguage dictionaries, thesauri, minimal perfect hashing and text compression.</jats:p>
Code References
python/cpython
1 file
Tools/unicode/dawg.py
1
L11
# Kowaltowski, T.; CL. Lucchesi (1993), "Applications of finite automata representing large vocabularies",
Link copied to clipboard!