BibTeX
@MISC{Daciuk00experimentswith,
author = {Jan Daciuk},
title = {Experiments with Automata Compression},
year = {2000}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
Citations
| 24 | Dictionnaires et lexiques: méthodes et algorithmes - Revuz - 1991 |
| 14 | Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table - Robert - 1979 |
| 13 | Incremental Construction of Finite-State Automata and Transducers - Daciuk - 1998 |
| 6 | Incremental construction of minimal acyclic state automata - Daciuk, Mihov, et al. - 2000 |
| 5 | Minimization of binary automata - Kowaltowski, Lucchesi, et al. - 1993 |
| 3 | and Tomasz Kowaltowski. Applications of automata representing large vocabularies. Software Practice and Experience - Lucchiesi - 1993 |
| 2 | Finite automata and ecient lexicon implementation - Kowaltowski, Lucchesi, et al. - 1998 |
| 2 | INTEX tutorial notes - Silberztein - 1999 |
| 1 | Compressed storage of sparse transducers - Kiraz - 1997 |
| 1 | Multext German morphology - Lehmann - 1996 |
| 1 | Finite-State Language Processing, chapter The Lexical Analysis of Natural Languages - Silberztein - 1997 |
