Abstract
This paper is a follow-up to Jan Daciuk’s experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory [4]. We investigate several techniques of reducing the memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve a size gain of around 20–30% compared to the original representation given in [4]. This result is comparable to the state-of-the-art dictionary compression techniques like the LZ-trie [10] method, but remains memory and CPU efficient during construction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Budiscak, I., Piskorski, J., Ristov, S.: Compressing Gazetteers Revisited. In: Yli-Jyrä, A., Kornai, A., Sakarovitch, J., Watson, B. (eds.) FSMNLP 2009. LNCS, vol. 6062, Springer, Heidelberg (2010)
Ciura, M., Deorowicz, S.: How to squeeze a lexicon. Software – Practice and Experience 31(11), 1077–1090 (2001)
Daciuk, J.: Incremental Construction of Finite-State Automata and Transducers, and their Use in the Natural Language Processing. Ph.D. thesis, Technical University of Gdańsk (1998)
Daciuk, J.: Experiments with automata compression. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 105–119. Springer, Heidelberg (2001)
Daciuk, J., Piskorski, J.: Gazetteer Compression Technique Based on Substructure Recognition. In: Proceedings of the International Conference on Intelligent Information Systems, Ustroń, Poland, pp. 87–95 (2006)
Daciuk, J., Piskorski, J., Ristov, S.: Scientific Applications of Language Methods. In: Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory, pp. 133–204. World Scientific Publishing, Singapore (2010)
Kowaltowski, T., Lucchesi, C.L., Stolfi, J.: Minimization of binary automata. In: 1st South American String Processing Workshop, Belo Horizonte, Brasil (1993)
Liang, F.M.: Word Hyphenation by Computer. Ph.D. thesis, Stanford University (1983)
Lucchiesi, C., Kowaltowski, T.: Applications of finite automata representing large vocabularies. Software Practice and Experience 23(1), 15–30 (1993)
Ristov, S., Laporte, É.: Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 196–211. Springer, Heidelberg (1999)
Tounsi, L.: Sous-automates à nombre fini d’états. Application à la compression de dictionnaires électroniques. Ph.D. thesis, Université François Rabelais Tours (2008)
Tounsi, L., Bouchou, B., Maurel, D.: A Compression Method for Natural Language Automata. In: Proceedings of the 7th International Workshop on Finite-State Methods and Natural Language Processing, Ispra, Italy, pp. 146–157 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daciuk, J., Weiss, D. (2011). Smaller Representation of Finite State Automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22256-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-22256-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22255-9
Online ISBN: 978-3-642-22256-6
eBook Packages: Computer ScienceComputer Science (R0)