Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Finite-State Methods and Natural Language Processing

FSMNLP 2009: Finite-State Methods and Natural Language Processing pp 13–30Cite as

fsm2 – A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6062))

Abstract

The present article describes fsm2, a software program which can be used interactively or as a script interpreter to manipulate weighted finite-state automata with around 100 different commands. fsm2 is based on FSM<2.0> – an efficient C++ template library to create and algebraically manipulate weighted automata.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI, Stanford (2003)

    Google Scholar 

  2. Roark, B., Sproat, R.: Computational Approaches to Syntax and Morphology. Oxford University Press, Oxford (2007)

    Google Scholar 

  3. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  4. Mohri, M.: Semiring Frameworks and Algorithms for Shortest-Distance Problems. Journal of Automata, Languages and Combinatorics 7(3), 321–350 (2002)

    MATH  MathSciNet  Google Scholar 

  5. Hanneforth, T.: Using ranked semirings for representing morphology automata. In: Mahlow, C., Pietrowski, M. (eds.) State of the Art in Computational Morphology, pp. 1–9. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Hanneforth, T.: Longest-match pattern matching with weighted finite state automata. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol. 4002, pp. 78–85. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Springer, Heidelberg (2009)

    Google Scholar 

  8. Mohri, M.: Minimization Algorithms for Sequential Transducers. Theoretical Computer Science 234, 177–201 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: Openfst: A general and efficient weighted finite-state transducer library. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 11–23. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Mohri, M.: Generic epsilon-removal algorithm for weighted automata. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 230–242. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Mohri, M., Pereira, F.C.N.: Dynamic compilation of weighted context-free grammars. In: Proceedings of ACL 1998, pp. 891–897 (1998)

    Google Scholar 

  12. Mohri, M., Nederhof, M.J.: Regular approximation of context-free grammars through transformation. In: Junqua, J.C., van Noord, G. (eds.) Robustness in Language and Speech Technology, pp. 153–163. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  13. Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science 231, 17–32 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Karttunen, L.: The replace operator. In: 33th Annual Meeting of the Association for Computational Linguistics, pp. 16–23 (1995)

    Google Scholar 

  15. Allauzen, C., Mohri, M., Roark, B.: Generalized Algorithms for Constructing Statistical Language Models. In: Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics. The Association for Computational Linguistics, vol. 41, pp. 40–47 (2003)

    Google Scholar 

  16. Hanneforth, T., Würzner, K.M.: Statistical language models within the algebra of weighted rational languages. Acta Cybernetica 19, 313–356 (2009)

    MathSciNet  Google Scholar 

  17. Katz, S.M.: Estimation of Probabilities from Sparse Data for the Language Model Component of a Speech Recognizer. IEEE Transactions on Acoustics, Speech and Signal Processing 35(3), 400–401 (1987)

    Article  Google Scholar 

  18. Jelinek, F.: Statistical Methods for Speech Recognition. Language, Speech and Communication. MIT Press, Cambridge (1997)

    Google Scholar 

  19. Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibiographic Search. Communications of the Asscociation for Computing Machinery 18(6), 333–340 (1975)

    MATH  MathSciNet  Google Scholar 

  20. Daciuk, J., Watson, B.W., Mihov, S., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Comput. Linguist. 26(1), 3–16 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. for Linguistics, University of Potsdam, Germany

    Thomas Hanneforth

Authors
  1. Thomas Hanneforth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Modern Languages, University of Helsinki, 00014, Finland

    Anssi Yli-Jyrä

  2. Institute for Quantitative Social Science, Harvard University, 1737, 02138, Cambridge, MA, USA

    András Kornai

  3. Laboratoire Traitement et Communication de L’Informations, Département Infoamtique et Réseaux, CNRS, 75634, Paris Cedex 13, France

    Jacques Sakarovitch

  4. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 5600, Eindhoven, MB, The Netherlands

    Bruce Watson

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hanneforth, T. (2010). fsm2 – A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata. In: Yli-Jyrä, A., Kornai, A., Sakarovitch, J., Watson, B. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2009. Lecture Notes in Computer Science(), vol 6062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14684-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14684-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14683-1

  • Online ISBN: 978-3-642-14684-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation