{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T13:38:42Z","timestamp":1775396322766,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4946,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0304-3975(99)00014-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"17-32","source":"Crossref","is-referenced-by-count":95,"title":["The design principles of a weighted finite-state transducer library"],"prefix":"10.1016","volume":"231","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":"78","reference":[{"key":"10.1016\/S0304-3975(99)00014-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB2","series-title":"Compilers: Principles, Techniques and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB4","doi-asserted-by":"crossref","unstructured":"K. Culik II, J. Kari, Digital images and formal languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Berlin, 1997, pp. 599\u2013616","DOI":"10.1007\/978-3-642-59126-6_10"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB5","doi-asserted-by":"crossref","unstructured":"M. Gross, The Use of Finite Automata in the Lexical Representation of Natural Language, Lecture Notes in Computer Science, vol. 377, Springer, Berlin, 1989.","DOI":"10.1007\/3-540-51465-1_3"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB6","doi-asserted-by":"crossref","unstructured":"M. Gross, D. Perrin (Eds.), Electronic Dictionnaries and Automata in Computational Linguistics, Lecture Notes in Computer Science, vol. 377, Springer, Berlin, 1989.","DOI":"10.1007\/3-540-51465-1"},{"issue":"3","key":"10.1016\/S0304-3975(99)00014-6_BIB7","first-page":"331","article-title":"Regular Models of Phonological Rule Systems","volume":"20","author":"Kaplan","year":"1994","journal-title":"Comput. Linguistics"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB8","doi-asserted-by":"crossref","unstructured":"F. Karlsson, A. Voutilainen, J. Heikkila, A. Anttila, Constraint Grammar, A language-Independent System for Parsing Unrestricted Text, Mouton de Gruyter, 1995.","DOI":"10.1515\/9783110882629"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB9","doi-asserted-by":"crossref","unstructured":"L. Karttunen, The Replace Operator, 33rd Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, 1995, pp. 16\u201323, Distributed by Morgan Kaufmann Publishers, San Francisco, CA.","DOI":"10.3115\/981658.981661"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB10","doi-asserted-by":"crossref","unstructured":"L. Karttunen, R.M. Kaplan, A. Zaenen, Two-level Morphology with Composition, in Proc. 15th Internat. Conf. on Computational Linguistics (COLING\u201992), Nantes, France, COLING, 1992.","DOI":"10.3115\/992066.992091"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB11","doi-asserted-by":"crossref","unstructured":"K. Koskenniemi, Finite-state parsing and disambiguation, Proc. 13th Internat. Conf. on Computational Linguistics (COLING\u201990), Helsinki, Finland, COLING, 1990.","DOI":"10.3115\/997939.997979"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB12","first-page":"1990","article-title":"Context dependent phonetic hidden Markov models for continuous speech recognition","volume":"38","author":"Lee","journal-title":"IEEE Trans. Acouts. Speech Signal Process."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB13","doi-asserted-by":"crossref","unstructured":"A. Ljolje, M.D. Riley, Optimal speech recognition using phone recognition and lexical access, in Proc. ICSLP, Banff, Canada, October 1992, pp. 313\u2013316.","DOI":"10.21437\/ICSLP.1992-69"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB14","doi-asserted-by":"crossref","unstructured":"M. Mohri, Compact representations by finite-state transducers, in 32nd Meeting of the Association for Computational Linguistics (ACL 94), Proc. Conf. Las Cruces, NM, ACL, 1994.","DOI":"10.3115\/981732.981760"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB15","doi-asserted-by":"crossref","unstructured":"M. Mohri, Minimization of Sequential Transducers, Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994.","DOI":"10.1007\/3-540-58094-8_14"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB16","unstructured":"M. Mohri, Syntactic Analysis by local grammars automata: an efficient algorithm, in Proc. Internat. Conf. on Computational Lexicography (COMPLEX 94), Linguistic Institute, Hungarian Academy of Science, Budapest, Hungary, 1994."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB17","first-page":"1996","volume":"J. Natural Language Eng.","author":"Mohri","journal-title":"On some applications of finite-state automata theory to natural language processing"},{"issue":"2","key":"10.1016\/S0304-3975(99)00014-6_BIB18","first-page":"269","article-title":"Finite-State Transducers in Language and Speech Processing","volume":"23","author":"Mohri","year":"1997","journal-title":"Comput. Linguistics"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB19","doi-asserted-by":"crossref","unstructured":"M. Mohri, On the use of sequential transducers in natural language processing, in: E. Roche, Y. Schabes (Eds.), Finite-State Language Processing, MIT Press, Cambridge, MA, 1997, 355\u2013382.","DOI":"10.7551\/mitpress\/3007.003.0014"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB20","unstructured":"M. Mohri, General Algebraic Framework and Algorithms for Shortest Distance Problems. Technical Memorandum, AT&T Labs-Research, 981210-TM, 1998."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB21","doi-asserted-by":"crossref","unstructured":"M. Mohri, Minimization algorithms for sequential transducers, Theoret. Comput. Sci. (2000) to appear..","DOI":"10.1016\/S0304-3975(98)00115-7"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB22","unstructured":"M. Mohri, F.C.N Pereira, M. Riley, Weighted automata in text and speech processing, in ECAI-96 Workshop, Budapest, Hungary, ECAI, 1996."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB23","doi-asserted-by":"crossref","unstructured":"M. Mohri, M. Riley, Weighted determinization and minimization for large vocabulary speech recognition, in Eurospeech\u201997, Rhodes, Greece, 1997.","DOI":"10.21437\/Eurospeech.1997-60"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB24","doi-asserted-by":"crossref","unstructured":"M. Mohri, M. Riley, D. Hindle, A. Ljolje, F.C. N. Pereira, Full expansion of context-dependent networks in large vocabulary speech recognition, in Proc. ICASSP\u201998, IEEE, New York, 1998.","DOI":"10.1109\/ICASSP.1998.675352"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB25","doi-asserted-by":"crossref","unstructured":"M. Mohri, R. Sproat, An efficient compiler for weighted rewrite rules, in 34th Meeting of the Association for Computational Linguistics (ACL 96), Proc. Conf., Santa Cruz, Ca, ACL, 1996.","DOI":"10.3115\/981863.981894"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB26","unstructured":"D. Musser, A. Saini, STL Tutorial and Reference Guide, Addison-Wesley, Reading, MA, 1996."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB27","doi-asserted-by":"crossref","unstructured":"F.C.N. Pereira, M.D. Riley, Speech recognition by composition of weighted finite automata, in: E. Roche, Y. Schabes (Eds.), Finite-State Language Processing, MIT Press, Cambridge, Ma, 1997, pp. 431\u2013453.","DOI":"10.7551\/mitpress\/3007.003.0017"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","article-title":"Minimisation of acyclic deterministic automata in linear time","volume":"92","author":"Revuz","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB29","doi-asserted-by":"crossref","unstructured":"G. Riccardi, E. Bocchieri, R. Pieraccini, Non-deterministic stochastic language models for speech recognition, in Proc. IEE Internat. Conf. on Acoustics, Speech and Signal Processing, vol. 1, IEEE, New York, 1995, pp. 237\u2013240","DOI":"10.1109\/ICASSP.1995.479408"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB30","doi-asserted-by":"crossref","unstructured":"M. Riley, F. Pereira, M. Mohri, Transducer composition for context-dependent network expansion, in Eurospeech\u201997, Rhodes, Greece, 1997.","DOI":"10.21437\/Eurospeech.1997-415"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB31","unstructured":"E. Ristad, P. Yianilos, Finite growth models, Technical Report CS-TR-533-96, Department of Computer Science, Princeton University, 1996."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB32","unstructured":"E. Roche, Analyse Syntaxique Transformationnelle du Fran\u00e7ais par Transducteurs et Lexique-Grammaire, Ph.D. Thesis, Universit\u00e9 Paris 7, 1993."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB33","doi-asserted-by":"crossref","unstructured":"E. Roche, Two parsing methods by means of finite state tansducers, in Proc. 16th Internat. Conf. on Computational Linguistics (COLING\u201994), Kyoto, Japan, COLING, 1994.","DOI":"10.3115\/991886.991962"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB34","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB35","doi-asserted-by":"crossref","unstructured":"M.P. Sch\u00fctzenberger, On the definition of a family of automata, Inform. Control 4 (1961).","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB36","unstructured":"M. Silberztein, Dictionnaires \u00e9lectroniques et analyse automatique de textes: le syst\u00e8me INTEX, Masson, Paris, France, 1993."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB37","doi-asserted-by":"crossref","unstructured":"I. Simon, Limited subsets of a free monoid, in Proc. 19th Annual Symp. on Foundation of Computer Science, 1978, pp. 143\u2013150.","DOI":"10.1109\/SFCS.1978.21"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB38","series-title":"Morphology and Computation","author":"Sproat","year":"1992"},{"key":"10.1016\/S0304-3975(99)00014-6_BIB39","unstructured":"R. Sproat, A finite-state architecture for tokenization and grapheme-to-phoneme conversion in multilingual text analysis, in Proc. ACL SIGDAT Workshop, Dublin, Ireland, ACL, 1995."},{"key":"10.1016\/S0304-3975(99)00014-6_BIB40","unstructured":"M. Mohri, F. Pereira, M. Riley, FSM Library \u2013 General-Purpose Finite. State Machine Software tools, http:\/\/www.research.att.com\/tools\/fsm, 1998."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:40:40Z","timestamp":1704152440000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0304397599000146"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00014-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}