|
|||||
|
|
Applications of finite automata representing large vocabularies |
|
| Authors: | Cl udio L. Lucchesi,Tomasz Kowaltowski |
| Affiliation: | Cláudio L. Lucchesi,Tomasz Kowaltowski |
| 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. |
| Keywords: | Finite acyclic automata Vocabularies Dictionaries Spelling checkers Thesauri Minimal perfect hashing Text compression |