Skip to main content
Springer Nature Link
Log in

WFSM Auto-intersection and Join Algorithms

  • Conference paper
Finite-State Methods and Natural Language Processing (FSMNLP 2005)

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

  • 697 Accesses

Abstract

The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. We provide an algorithm that computes the join of two machines via a more simple operation, the auto-intersection. The two operations generally do not preserve rationality. A delay-based algorithm is described for the case of a single tape pair, as well as the class of auto-intersections that it handles. It is generalized to multiple tape pairs and some enhancements are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 114–125 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  2. Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development 9, 47–68 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kay, M.: Nonconcatenative finite-state morphology. In: Proc. 3rd Int. Conf. EACL, Copenhagen, Denmark, pp. 2–10 (1987)

    Google Scholar 

  4. Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78, 347–355 (1991)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  6. Kempe, A., Champarnaud, J.M., Eisner, J.: A note on join and auto-intersection of n-ary rational relations. In: Watson, B., Cleophas, L. (eds.) Proc. Eindhoven FASTAR Days. Number 04–40 in TU/e CS TR, Eindhoven, Netherlands, pp. 64–78 (2004)

    Google Scholar 

  7. Kiraz, G.A.: Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic. Computational Lingistics 26, 77–105 (2000)

    Article  Google Scholar 

  8. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, San Diego (1974)

    MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  10. Mohri, M., Pereira, F.C.N., Riley, M.: A rational design for a weighted finite-state transducer library. In: Wood, D., Yu, S. (eds.) WIA 1997. LNCS, vol. 1436, pp. 144–158. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Kempe, A., Guingne, F., Nicart, F.: Algorithms for weighted multi-tape automata. Research report 2004/031, Xerox Research Centre Europe, Meylan, France (2004)

    Google Scholar 

  12. Rosenberg, A.L.: On n-tape finite state acceptors. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 76–81 (1964)

    Google Scholar 

  13. Eisner, J.: Parameter estimation for probabilistic finite-state transducers. In: Proc. of the 40th Annual Meeting of the Association for Computational Linguistics, Philadelphia (2002)

    Google Scholar 

  14. Kempe, A.: NLP applications based on weighted multi-tape automata. In: Proc. 11th Conf. TALN, Fes, Morocco, pp. 253–258 (2004)

    Google Scholar 

  15. Kempe, A., Champarnaud, J.M., Eisner, J., Guingne, F., Nicart, F.: A class of rational n-WFSM auto-intersections. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 188–198. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theoretical Computer Science 108, 45–82 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mohri, M.: Edit-distance of weighted automata. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 1–23. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grenoble Laboratory, Xerox Research Centre Europe, 6 chemin de Maupertuis, 38240, Meylan, France

    A. Kempe, F. Guingne & F. Nicart

  2. PSI Laboratory (Université de Rouen, CNRS), 76821, Mont-Saint-Aignan, France

    J. -M. Champarnaud

  3. LIFAR Laboratory (Université de Rouen), 76821, Mont-Saint-Aignan, France

    F. Guingne & F. Nicart

Authors
  1. A. Kempe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. -M. Champarnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Guingne
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. F. Nicart
    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

Kempe, A., Champarnaud, J.M., Guingne, F., Nicart, F. (2006). WFSM Auto-intersection and Join Algorithms. 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_13

Download citation

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

  • 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