Applications of finite automata representing large vocabularies
Software—Practice & Experience
Communications of the ACM
Compressed Storage of Sparse Finite-State Transducers
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
Finite Automata for Compact Representation of Language Models in NLP
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Smaller representation of finite state automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Smaller representation of finite state automata
Theoretical Computer Science
| Hi-index | 0.00 |
Several compression methods of finite-state automata are presented and evaluated. Most compression methods used here are already described in the literature. However, their impact on the size of automata has not been described yet. We fill that gap, presenting results of experiments carried out on automata representing German, and Dutch morphological dictionaries.