Longest-Match Pattern Matching with Weighted Finite State Automata

  • Thomas Hanneforth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4002)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abney, S.: Partial parsing via finite-state cascades. In: Proceedings of ESSLLI 1996, Robust Parsing Workshop (1996)Google Scholar
  2. 2.
    Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)MATHGoogle Scholar
  3. 3.
    Aho, A., Sethi, R., Ullman, J.: Compilers. Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)MATHGoogle Scholar
  4. 4.
    Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003)Google Scholar
  5. 5.
    Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol. 2962. Springer, Heidelberg (2004)MATHGoogle Scholar
  6. 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)MATHGoogle Scholar
  7. 7.
    Didakowski, J.: Robustes parsing und disambiguierung mit gewichteten transduktoren. Diploma thesis, University of Potsdam (2005)Google Scholar
  8. 8.
    Kaplan, R., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)Google Scholar
  9. 9.
    Karttunen, L.: Directed replacement. In: Proceedings of the 34rd Annual Meeting of the ACL, Santa Cruz, CA (1996)Google Scholar
  10. 10.
    Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York (1976)Google Scholar
  11. 11.
    Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Language, and Combinatorics 7(3), 321–350 (2002)MathSciNetMATHGoogle Scholar
  12. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Thomas Hanneforth
    • 1
  1. 1.Institut für LinguistikUniversität PotsdamPotsdamGermany

Personalised recommendations