{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T06:26:44Z","timestamp":1778308004994,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540646945","type":"print"},{"value":"9783540691044","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0031388","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:38:17Z","timestamp":1134286697000},"page":"144-158","source":"Crossref","is-referenced-by-count":30,"title":["A rational design for a weighted finite-state transducer library"],"prefix":"10.1007","author":[{"given":"Mehryar","family":"Mohri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Riley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,29]]},"reference":[{"key":"13_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison Wesley: Reading, MA, 1974."},{"key":"13_CR2","volume-title":"Compilers: Principles, Techniques and Tools","author":"A. V. Aho","year":"1986","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison Wesley: Reading, MA, 1986."},{"key":"13_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"J. Berstel and C. Reutenauer. Rational Series and Their Languages. Springer-Verlag: Berlin-New York, 1988."},{"key":"13_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1992","unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press: Cambridge, MA, 1992."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"K. Culik II and J. Kari. Digital images and formal languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, pages 599\u2013616. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_10"},{"key":"13_CR6","unstructured":"S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, 1974\u20131976."},{"key":"13_CR7","unstructured":"R. M. Kaplan and M. Kay. Regular models of phonological rule systems. Computational Linguistics, 20(3), 1994."},{"key":"13_CR8","series-title":"Association for Computational Linguistics","doi-asserted-by":"crossref","first-page":"16","DOI":"10.3115\/981658.981661","volume-title":"33rd Annual Meeting of the Association for Computational Linguistics","author":"L. Karttunen","year":"1995","unstructured":"L. Karttunen. The replace operator. In 33rd Annual Meeting of the Association for Computational Linguistics, pages 16\u201323. Association for Computational Linguistics, 1995. Distributed by Morgan Kaufmann Publishers, San Francisco, California."},{"key":"13_CR9","series-title":"Number 5 in EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"W. Kuich and A. Salomaa. Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1986."},{"issue":"4","key":"13_CR10","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/29.52701","volume":"38","author":"K.-F. Lee","year":"1990","unstructured":"K.-F. Lee. Context dependent phonetic hidden Markov models for continuous speech recognition. IEEE Trans. ASSP, 38(4):599\u2013609, Apr. 1990.","journal-title":"IEEE Trans. ASSP"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"A. Ljolje and M. D. Riley. Optimal speech recognition using phone recognition and lexical access. In Proceedings of ICSLP, pages 313\u2013316, Banff, Canada, Oct. 1992.","DOI":"10.21437\/ICSLP.1992-69"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"M. Mohri. Minimization of sequential transducers. Lecture Notes in Computer Science, 807, 1994.","DOI":"10.1007\/3-540-58094-8_14"},{"key":"13_CR13","volume-title":"Proceedings of the International Conference on Computational Lexicography (COMPLEX 94)","author":"M. Mohri","year":"1994","unstructured":"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."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S135132499600126X","volume":"2","author":"M. Mohri","year":"1996","unstructured":"M. Mohri. On some applications of finite-state automata theory to natural language processing. Journal of Natural Language Engineering, 2:1\u201320, 1996.","journal-title":"Journal of Natural Language Engineering"},{"key":"13_CR15","unstructured":"M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23, 1997."},{"key":"13_CR16","unstructured":"M. Mohri. A general framework for shortest distance problems, 1997. In preparation."},{"key":"13_CR17","unstructured":"M. Mohri, F. C. N. Pereira, and M. Riley. Weighted automata in text and speech processing. In ECAI-96 Workshop, Budapest, Hungary. ECAI, 1996."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.3115\/981863.981894"},{"key":"13_CR19","unstructured":"D. Musser and A. Saini. STL Tutorial and Reference Guide. Addison-Wesley, 1996."},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"D. Revuz. Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92:181\u2013189, 1992.","journal-title":"Theoretical Computer Science"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013240. IEEE, 1995.","DOI":"10.1109\/ICASSP.1995.479408"},{"key":"13_CR22","unstructured":"E. Ristad and P. Yianilos. Finite growth models. Technical report CS-TR-533-96, Department of Computer Science, Princeton University, 1996."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"M. P. Sch\u00fctzenberger. On the definition of a family of automata. Information and Control, 4, 1961.","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"I. Simon. Limited subsets of a free monoid. In Proceedings of the 19th Annual Symposium on Foundation of Computer Science, pages 143\u2013150, 1978.","DOI":"10.1109\/SFCS.1978.21"},{"key":"13_CR25","doi-asserted-by":"crossref","first-page":"66","DOI":"10.3115\/981732.981742","volume-title":"32nd Annual Meeting of the Association for Computational Linguistics","author":"R. Sproat","year":"1994","unstructured":"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\u201373, San Francisco, California, 1994. New Mexico State University, Las Cruces, New Mexico, Morgan Kaufmann."}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T21:22:14Z","timestamp":1683321734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646945","9783540691044"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0031388","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}