Skip to main content
SpringerLink
Log in

Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries

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

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

Included in the following conference series:

Abstract

We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We outline the most important methods, including the traditional ones (which consist of the combination of two phases: insertion of words and minimization of the partial automaton) and the incremental algorithms (which add new words one by one and minimize the resulting automaton on-the-fly, being much faster and having significantly lower memory requirements). We analyze their main features in order to provide some improvements for incremental constructions, and a general architecture that is needed to implement large dictionaries in natural language processing (NLP) applications.

This work has been partially supported by the European Union (under FEDER project 1FD97-0047-C04-02), by the Spanish Government (under project TIC2000-0370-C02-01), and by the Galician Government (under project PGIDT99XI10502B).

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. Aho, A. V.; Sethi, R.; Ullman, J.D. (1985). Compilers: principles, techniques and tools. Addison-Wesley, Reading, MA.

    Google Scholar 

  2. Daciuk, J.; Mihov, S.; Watson, B.W.; Watson, R.E. (2000). Incremental construction of minimal acyclic finite-state automata. Computational Linguistics, vol. 26(1), pp. 3–16.

    Article  MathSciNet  Google Scholar 

  3. Graña Gil, J. (2000). Robust parsing techniques for natural language tagging (in Spanish). PhD. Thesis, Departamento de Computación, Universidad de La Coruña (Spain).

    Google Scholar 

  4. Hopcroft, J.E.; Ullman, J.D. (1979). Introduction to automata theory, languages and computations. Addison-Wesley, Reading, MA.

    Google Scholar 

  5. Lucchesi, C. L.; Kowaltowski, T. (1993). Applications of finite automata representing large vocabularies. Software-Practice and Experience, vol. 23(1), pp. 15–30.

    Article  Google Scholar 

  6. Revuz, D. (1992). Minimization of acyclic deterministic automata in linear time. Theoretical Computer Science, vol. 92(1), pp. 181–189.

    Article  MATH  MathSciNet  Google Scholar 

  7. Watson, B.W. (1993). A taxonomy of finite automata construction algorithms. Computing Science Note 93/43, Eindhoven University of Technology, (The Netherlands).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Computación, Facultad de Informática, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain

    Jorge Graña, Fco. Mario Barcala & Miguel A. Alonso

Authors
  1. Jorge Graña
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fco. Mario Barcala
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miguel A. Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Pretoria, Lynwood Road, Pretoria, 0002, South Africa

    Bruce W. Watson

  2. Department of Computer Science, Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong

    Derick Wood

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Graña, J., Barcala, F.M., Alonso, M.A. (2002). Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-36390-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00400-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation