Applications of finite automata representing large vocabularies
Cláudio Leonardo Lucchesi, Tomasz Kowaltowski · Software Practice and Experience · 1993
Abstract 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.