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 93–104Cite as

Joining Composition and Trimming of Finite-State Transducers

  • Conference paper

  • 627 Accesses

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

Abstract

The composition of two (weighted) finite-state transducers is usually carried out in two steps: In the first step, all accessible states of the result are constructed regardless of their co-accessibility. Non-co-accessible states are removed afterwards in the second step. This approach can lead to huge intermediate automata with only a fraction of their states being useful in the end. We present a novel composition algorithm which avoids the construction of non useful states by using a single depth-first traversal while having the same asymptotic complexity as the existing approaches.

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. Mohri, M.: Finite-State Transducers in Language and Speech Processing. Computational Linguistics 23(2), 269–311 (1997)

    MathSciNet  Google Scholar 

  2. Pereira, F.C., Riley, M.D.: Speech Recognition by Composition of Weighted Finite Automata. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing. Language, Speech, and Communication, vol. 12, pp. 433–453. The MIT Press, Cambridge (1997)

    Google Scholar 

  3. Mohri, M., Pereira, F.C., Riley, M.D.: Speech Recognition with Weighted Finite-State Transducers. In: Rabiner, L., Juang, F. (eds.) Handbook on Speech Processing and Speech Communication, Part E: Speech recognition, pp. 1–31. Springer, Heidelberg (2007)

    Google Scholar 

  4. Mohri, M.: Weighted Automata Algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. EACTS Monographs in Theoretical Computer Science, pp. 213–254. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Tarjan, R.E.: Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  7. Ésik, Z., Kuich, W.: Equational Axioms for a Theory of Automata. In: Vide, C.M., Mitrana, V., Păun, G. (eds.) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol. 148, pp. 183–196. Springer, Heidelberg (2004)

    Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, Reading (1979)

    MATH  Google Scholar 

  9. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  10. Mohri, M.: Weighted Finite-State Transducer Algorithms: An Overview. In: Martín-Vide, C., Mitrana, V., Paun, G. (eds.) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol. 148, pp. 551–564. Springer, Heidelberg (2004)

    Google Scholar 

  11. Hanneforth, T.: FSM<2.0> – C++ Library for Manipulating (Weighted) Finite Automata (2004), http://www.ling.uni-potsdam.de/tom/fsm/

  12. 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 

  13. Kaplan, R.M., Kay, M.: Regular Models of Phonological Rule Systems. Computational Linguistics 20(3), 331–378 (1994)

    Google Scholar 

  14. Cheng, O., Dines, J., Doss, M.M.: A Generalized Dynamic Composition Algorithm of Weighted Finite State Transducers for Large Vocabulary Speech Recognition. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2007), vol. 4, pp. 345–348. IEEE, Los Alamitos (2007)

    Google Scholar 

  15. Hori, T., Hori, C., Minami, Y.: Fast On-The-Fly Composition for Weighted Finite-State Transducers in 1.8 Million-Word Vocabulary Continuous Speech Recognition. INTERSPEECH, 289–292 (2004)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. Tarjan, R.E.: Finding Dominators in Directed Graphs. SIAM Journal on Computing 3(1), 62–89 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  18. Nuutila, E., Soisalon-Soininen, E.: On Finding the Strongly Connected Components in a Directed Graph. Information Processing Letters 49(1), 9–14 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Potsdam,  

    Johannes Bubenzer & Kay-Michael Würzner

Authors
  1. Johannes Bubenzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kay-Michael Würzner
    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

Bubenzer, J., Würzner, KM. (2010). Joining Composition and Trimming of Finite-State Transducers. 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_10

Download citation

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

  • 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