{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T11:14:24Z","timestamp":1781781264629,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540763352","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_3","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"11-23","source":"Crossref","is-referenced-by-count":214,"title":["OpenFst: A General and Efficient Weighted Finite-State Transducer Library"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Allauzen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Riley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan","family":"Schalkwyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Skut","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(99)00014-6","volume":"231","author":"M. Mohri","year":"2000","unstructured":"Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science\u00a0231, 17\u201332 (2000)","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","unstructured":"Adant, A.: WFST: a finite-state template library in C++ (2000), http:\/\/membres.lycos.fr\/adant\/tfe"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Hetherington, L.: The MIT finite-state transducer toolkit for speech and language processing. In: Proceedings of the ICSLP, Jeju, South Korea (2004)","DOI":"10.21437\/Interspeech.2004-694"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Kanthak, S., Ney, H.: FSA: An efficient and flexible C++ toolkit for finite state automata using on-demand computation. In: Proceedings of 42nd Meeting of the ACL, pp. 510\u2013517 (2004)","DOI":"10.3115\/1218955.1219020"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2004.07.007","volume":"328","author":"S. Lombardy","year":"2004","unstructured":"Lombardy, S., R\u00e9gis-Gianas, Y., Sakarovitch, J.: Introducing VAUCANSON. Theoretical Computer Science\u00a0328, 77\u201396 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978)"},{"key":"3_CR7","series-title":"Number\u00a05 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":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Number\u00a05 in EATCS Monographs on Theoretical Computer Science. Springer, Germany (1986)"},{"key":"3_CR8","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":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. Springer, New York (1988)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Cortes, C., Mohri, M., Rastogi, A., Riley, M.: On the computation of the relative entropy of probabilistic automata. International Journal of Foundations of Computer Science (2007)","DOI":"10.21236\/ADA606160"},{"key":"3_CR10","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023 (1997)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M. Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science\u00a0234, 177\u2013201 (2000)","journal-title":"Theoretical Computer Science"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1142\/S0129054102000996","volume":"13","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Generic epsilon-removal and input epsilon-normalization algorithms for weighted transducers. International Journal of Foundations of Computer Science\u00a013, 29\u2013143 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"3_CR13","first-page":"321","volume":"7","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics\u00a07, 321\u2013350 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T14:54:02Z","timestamp":1684076042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_3","relation":{},"subject":[]}}