Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Finite-State Methods and Natural Language Processing

FSMNLP 2005: Finite-State Methods and Natural Language Processing pp 78–85Cite as

Longest-Match Pattern Matching with Weighted Finite State Automata

  • Conference paper

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

Abstract

I present a new method of longest match pattern matching based on weighted finite state automata. Contrary to the approach of Karttunen [9] we do not need expensive complementation operations to construct the pattern matching transducer.

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. Abney, S.: Partial parsing via finite-state cascades. In: Proceedings of ESSLLI 1996, Robust Parsing Workshop (1996)

    Google Scholar 

  2. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  3. Aho, A., Sethi, R., Ullman, J.: Compilers. Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)

    MATH  Google Scholar 

  4. Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003)

    Google Scholar 

  5. Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol. 2962. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  6. Cormen, T.H., Leiserson, C.L., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Electrical Engineering and Computer Science Series. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  7. Didakowski, J.: Robustes parsing und disambiguierung mit gewichteten transduktoren. Diploma thesis, University of Potsdam (2005)

    Google Scholar 

  8. Kaplan, R., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)

    Google Scholar 

  9. Karttunen, L.: Directed replacement. In: Proceedings of the 34rd Annual Meeting of the ACL, Santa Cruz, CA (1996)

    Google Scholar 

  10. Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York (1976)

    Google Scholar 

  11. Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Language, and Combinatorics 7(3), 321–350 (2002)

    MathSciNet  MATH  Google Scholar 

  12. Mohri, M., Sproat, R.: An efficient compiler for weighted rewrite rules. In: Proceedings of the 34rd Annual Meeting of the ACL, Santa Cruz, CA (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Linguistik, Universität Potsdam, PF 601553, 14415, 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. Language Research Service, CSC Scientific Computing Ltd., Finland

    Anssi Yli-Jyrä

  2. Palo Alto Research Center, Stanford University, P.O. Box, USA

    Lauri Karttunen

  3. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hanneforth, T. (2006). Longest-Match Pattern Matching with Weighted Finite State Automata. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2005. Lecture Notes in Computer Science(), vol 4002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780885_9

Download citation

  • DOI: https://doi.org/10.1007/11780885_9

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-35469-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation