Skip to main content
SpringerLink
Log in

Implementation of Dictionaries via Automata and Decision Trees

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

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

Included in the following conference series:

Abstract

Finite-state transducers can be used to map a language onto a set of values. This paper proposes an alternate representation method for such a mapping, consisting of associating a finite-state automaton accepting the input language with a decision tree representing the output values. The advantages of this approach are that it leads to more compact representations than transducers, and that decision trees can easily be synthesized by machine learning techniques.

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. Aoe, J-I., Morimoto, K., Shishibori, M., and Park, K. A trie compaction algorithm for a large set of keys. IEEE Transaction on Knowledge and Data Engineering8, 3 (1996), 476–491.

    Article  Google Scholar 

  2. Bentley, J., and Sedgewick B. Fast algorithms for sorting and searching strings. In Annual ACM-SIAM Symposium on Discrete Algorithms (1996), pp. 1–10.

    Google Scholar 

  3. Bescherelle. L’art de Conjuguer. Hatier, Paris, 1966.

    Google Scholar 

  4. Czech, Z. J., and Majewski, B. S. An optimal algorithm for generating minimal perfect hash function. Information Processing Letters 43 (1992), 257–264.

    Article  MATH  MathSciNet  Google Scholar 

  5. Daciuk, J., Mihov, S., Watson, B. W., and Watson, R. E. Incremental construction of finite-state automata. Association for Computational Linguistics 26, 1 (2000), 3–16.

    Article  MathSciNet  Google Scholar 

  6. Brain, M. D., and Tharp, A. L. Using trie to eliminate pattern collision in perfect hashing. IEEE Transaction on Knowledge and Data Engineering 6 (1994), 476–491.

    Article  Google Scholar 

  7. Fatholahzadeh, A. DAWG-ID3: Retrieving key-information using graph and classification algorithms. In International Symposium on Database Technology & Software Engineering, WEB and Cooperative Systems (2000), Lasker G. E. and Gerhard W. (eds.), 117–124.

    Google Scholar 

  8. Fatholahzadeh, A. Experiments with automata and information gain. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian E., and Yu S. (eds.), 252.

    Google Scholar 

  9. Fatholahzadeh, A. Nationality word graph for fast information retrieval. In Collaborative Electronic Commerce Technology and Research (2000), Williams M. A. and P. Swatman P. (eds.), International Conference on Knowledge Representation, 1–12. Available via http://www.collecter.org/collUSA.

  10. Fatholahzadeh, A. Tagging nationality words using automata. In ROMMAND: RObust Methods in Analysis of Natural Language Data (Swiss 2000), Ballim A., Pallotta V., and Ghorbel H. (eds.), 69–76.

    Google Scholar 

  11. Fatholahzadeh, A. Online treatment of official names. In International Conference on Artificial Intelligence (2001), Arabnia H. R.(ed.), 203–209.

    Google Scholar 

  12. Kempe, A. Factorizations of ambiguous finite-state transducers. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian M., and Yu S. (eds.), 157–164.

    Google Scholar 

  13. Mihov, S., and Murel, D. Direct construction of minimal acyclic sub-sequential transducers. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian E., and S. Yu (eds.), 150–156.

    Google Scholar 

  14. Mitchell, T. M. Machine Learning. McGraw-Hill, 1997.

    Google Scholar 

  15. Mohri, M. On some application of finite-state automata theory to natural language. Natural Language Engineering 2, 1 (1996), 1–20.

    Article  Google Scholar 

  16. Mohri, M. Finite-state transducers in language and speech processing. Computational Linguistics 23, 2 (1997), 269–311.

    MathSciNet  Google Scholar 

  17. Mohri, M. Generic ∈-removal algorithm for weighted automata. In International Conference on Implementation and Application of Automata (2000), Daley M., Eramian E., and Yu S. (eds.) 26–35.

    Google Scholar 

  18. Quinlan, R. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.

    Google Scholar 

  19. Rozenberg G. and Salomaa A. (eds.) Handbook of Formal Language. Springer-Verlag, Berlin Heidelberg, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Supélec - Campus de Metz, 2, rue Édouard Belin, 57078, Metz, France

    Abolfazl Fatholahzadeh

Authors
  1. Abolfazl Fatholahzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, Université de Rouen, LIFAR, 76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud

  2. Departement Informatique, Laboratoire d’Informatique de l’Université de Tours École Polytechnique de l’Université de Tours, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fatholahzadeh, A. (2003). Implementation of Dictionaries via Automata and Decision Trees. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-44977-9_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40391-3

  • Online ISBN: 978-3-540-44977-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation