Application of Finite Automata in Debugging Natural Language Vocabularies (1993)
by
Tomasz Kowaltowski
,
Cláudio L. Lucchesi
,
Cl'audio L. Lucchesi
,
Jorge Stolfi
| Venue: | Journal of the Brazilian Computer Society |
| Citations: | 1 - 1 self |
BibTeX
@ARTICLE{Kowaltowski93applicationof,
author = {Tomasz Kowaltowski and Cláudio L. Lucchesi and Cl'audio L. Lucchesi and Jorge Stolfi},
title = {Application of Finite Automata in Debugging Natural Language Vocabularies},
journal = {Journal of the Brazilian Computer Society},
year = {1993},
volume = {1}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Finite acyclic automata can be used as a very versatile tool in many applications involving natural language vocabularies. This work describes some experiments in "debugging" semi-automatically such vocabularies, i. e. suggesting non-existent and missing words. Partial statistics are shown for Portuguese, Italian and English vocabularies.
Citations
| 34 | Development of a Spelling List - McIlroy - 1982 |
| 31 | The World’s Fastest Scrabble Program - Appel, Jacobson - 1988 |
| 19 | Applications of finite automata representing large vocabularies - Lucchesi, Kowaltowski - 1993 |
| 1 | Minimization of binary automata", in this issue - Kowaltowski, Lucchesi, et al. |
