Applications of Finite Automata in Debugging Natural Language Vocabularies

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.

1993