Skip to main content
SpringerLink
Log in

Experiments with Automata Compression

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2088))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.H. Baayen, R. Piepenbrock, and H. The CELEX Lexical Database (CD-ROM). Linguistic Data Consortium, University of Pennsylvania, Philadelphia, PA, 1993, 1993.

    Google Scholar 

  2. Jan Daciuk. Incremental Construction of Finite-State Automata and Transducers, and their Use in the Natural Language Processing. PhD thesis, Technical University of Gdańsk, 1998.

    Google Scholar 

  3. Jan Daciuk, Stoyan Mihov, Bruce Watson, and Richard Watson. Incremental construction of minimal acyclic finite state automata. Computational Linguistics, 26(1):3–16, April 2000.

    Article  MathSciNet  Google Scholar 

  4. George A. Kiraz. Compressed storage of sparse finite-state transducers. In Workshop on Implementing Automata WIA99-Pre-Proceedings, pages XIX-1–XIX-31. 1997.

    Google Scholar 

  5. Tomasz Kowal towski, Cláudio L. Lucchesi, and Jorge Stolfi. Finite automata and efficient lexicon implementation. Technical Report IC-98-02, January 1998.

    Google Scholar 

  6. Tomasz Kowaltowski, Cláudio L. Lucchesi, and Jorge Stolfi. Minimization of binary automata. In First South American String Processing Workshop, Belo Horizonte, Brasil, 1993.

    Google Scholar 

  7. Sabine Lehmann. Multext German morphology. ISSCO, Geneva, September 12 1996.

    Google Scholar 

  8. Claudio Lucchiesi and Tomasz Kowaltowski. Applications of finite automata representing large vocabularies. Software Practice and Experience, 23(1):15–30, Jan. 1993.

    Article  Google Scholar 

  9. Dominique Revuz. Dictionnaires et lexiques: méthodes et algorithms. PhD thesis, Institut Blaise Pascal, Paris, France, 1991. LITP 91.44.

    Google Scholar 

  10. Max Silberztein. Finite-State Language Processing, chapter The Lexical Analysis of Natural Languages, pages 175–203. MIT Press, 1997.

    Google Scholar 

  11. Max Silberztein. INTEX tutorial notes. In Workshop on Implementing Automata WIA99-Pre-Proceedings, pages XIX-1–XIX-31. 1999.

    Google Scholar 

  12. Robert Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606–611, November 1979.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Alfa Informatica, Rijksuniversiteit Groningen, Oude Kijk in’t Jatstraat 26, 716, 9700, AS, Groningen, the Netherlands

    Jan Daciuk

Authors
  1. Jan Daciuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, ON, Canada, N6A 5B7

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Daciuk, J. (2001). Experiments with Automata Compression. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation