This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison Wesley: Reading, MA, 1974.
A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison Wesley: Reading, MA, 1986.
J. Berstel and C. Reutenauer. Rational Series and Their Languages. Springer-Verlag: Berlin-New York, 1988.
T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press: Cambridge, MA, 1992.
K. Culik II and J. Kari. Digital images and formal languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, pages 599–616. Springer, 1997.
S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, 1974–1976.
R. M. Kaplan and M. Kay. Regular models of phonological rule systems. Computational Linguistics, 20(3), 1994.
L. Karttunen. The replace operator. In 33rd Annual Meeting of the Association for Computational Linguistics, pages 16–23. Association for Computational Linguistics, 1995. Distributed by Morgan Kaufmann Publishers, San Francisco, California.
W. Kuich and A. Salomaa. Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1986.
K.-F. Lee. Context dependent phonetic hidden Markov models for continuous speech recognition. IEEE Trans. ASSP, 38(4):599–609, Apr. 1990.
A. Ljolje and M. D. Riley. Optimal speech recognition using phone recognition and lexical access. In Proceedings of ICSLP, pages 313–316, Banff, Canada, Oct. 1992.
M. Mohri. Minimization of sequential transducers. Lecture Notes in Computer Science, 807, 1994.
M. Mohri. Syntactic analysis by local grammars automata: an efficient algorithm. In Proceedings of the International Conference on Computational Lexicography (COMPLEX 94). Linguistic Institute, Hungarian Academy of Science: Budapest, Hungary, 1994.
M. Mohri. On some applications of finite-state automata theory to natural language processing. Journal of Natural Language Engineering, 2:1–20, 1996.
M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23, 1997.
M. Mohri. A general framework for shortest distance problems, 1997. In preparation.
M. Mohri, F. C. N. Pereira, and M. Riley. Weighted automata in text and speech processing. In ECAI-96 Workshop, Budapest, Hungary. ECAI, 1996.
M. Mohri and R. Sproat. An efficient compiler for weighted rewrite rules. In 34th Meeting of the Association for Computational Linguistic s (A CL 96), Proceedings of the Conference, Santa Cruz, California. ACL, 1996.
D. Musser and A. Saini. STL Tutorial and Reference Guide. Addison-Wesley, 1996.
D. Revuz. Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92:181–189, 1992.
G. Riccardi, E. Bocchieri, and R. Pieraccini. Non-deterministic stochastic language models for speech recognition. In Proceedings IEE International Conference on Acoustics, Speech and Signal Processing, volume 1, pages 237–240. IEEE, 1995.
E. Ristad and P. Yianilos. Finite growth models. Technical report CS-TR-533-96, Department of Computer Science, Princeton University, 1996.
M. P. Schützenberger. On the definition of a family of automata. Information and Control, 4, 1961.
I. Simon. Limited subsets of a free monoid. In Proceedings of the 19th Annual Symposium on Foundation of Computer Science, pages 143–150, 1978.
R. Sproat, C. Shih, W. Gale, and N. Chang. A stochastic finite-state wordsegmentation algorithm for Chinese. In 32nd Annual Meeting of the Association for Computational Linguistics, pages 66–73, San Francisco, California, 1994. New Mexico State University, Las Cruces, New Mexico, Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohri, M., Pereira, F., Riley, M. (1998). A rational design for a weighted finite-state transducer library. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031388
Download citation
DOI: https://doi.org/10.1007/BFb0031388
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive