Skip to main content
SpringerLink
Log in

Factorization of Ambiguous Finite-State Transducers

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

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

Included in the following conference series:

Abstract

This article describes an algorithm for factorizing a finitely ambiguous finite-state transducer (FST) into two FSTs, T1 and T2, such that T1 is functional and T2 retains the ambiguity of the original FST. The application of T2 to the output of T1 never leads to a state that does not provide a transition for the next input symbol, and always terminates in a final state. In other words, T2 contains no “failing paths” whereas T1 in general does. Since T1 is functional, it can be factorized into a left-sequential and a right-sequential FST that jointly constitute a bimachine. The described factorization can accelerate the processing of input because no failing paths are ever followed.

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. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, USA.

    MATH  Google Scholar 

  2. J. Berstel. 1979. Transductions and Context-Free Languages. Number 38 in Leitfäden der angewandten Mathematik und Mechanik (LAMM). Studienbücher Informatik. Teubner, Stuttgart, Germany.

    Google Scholar 

  3. C.C. Elgot, and J.E. Mezei. 1965. On relations defined by generalized finite automata. IBM Journal of Research and Development, pages 47–68, January.

    Google Scholar 

  4. L. Karttunen, J.-P. Chanod, G. Grefenstette, and A. Schiller. 1996. Regular expressions for language engineering. Natural Language Engineering, 2(4):305–328.

    Article  Google Scholar 

  5. A. Kempe. 2000. Reduction of intermediate alphabets in finite-state transducer cascades. In Proc. 7th Conference on Automatic Natural Language Processing (TALN), Lausanne, Switzerland. to appear

    Google Scholar 

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

    MathSciNet  Google Scholar 

  7. C. Reutenauer, and M.P. Schützenberger. 1991. Minimization of rational word functions. SIAM Journal of Computing, 20(4):669–685.

    Article  MATH  Google Scholar 

  8. J. Sakarovitch. 1998. A construction on finite automata that has remained hidden. Theoretical Computer Science, 204:205–231.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.P. Schützenberger. 1961. A remark on finite transducers. Information and Control, 4:185–187.

    Article  MATH  MathSciNet  Google Scholar 

  10. M.P. Schützenberger. 1976. Sur les rélations rationelles entre monoïdes libres. Theoretical Computer Science, 3:243–259.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    André Kempe

Authors
  1. André Kempe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, ON, Canada, N6A 5B7

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kempe, A. (2001). Factorization of Ambiguous Finite-State Transducers. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation