Applications of finite automata representing large vocabularies
- 1 January 1993
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 23 (1) , 15-30
- https://doi.org/10.1002/spe.4380230103
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
This publication has 4 references indexed in Scilit:
- Electronic Dictionaries and Automata in Computational LinguisticsPublished by Springer Nature ,1989
- The world's fastest Scrabble programCommunications of the ACM, 1988
- Programming pearlsCommunications of the ACM, 1985
- Development of a Spelling ListIEEE Transactions on Communications, 1982