{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:22:37Z","timestamp":1743067357356,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319223599"},{"type":"electronic","value":"9783319223605"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22360-5_22","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T08:24:42Z","timestamp":1437985482000},"page":"263-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Disambiguation of Weighted Automata"],"prefix":"10.1007","author":[{"given":"Mehryar","family":"Mohri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael D.","family":"Riley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Albert, J., Kari, J.: Digital image compression. In: Handbook of Weighted Automata. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-01492-5_11"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Allauzen, C., Benson, E., Chelba, C., Riley, M., Schalkwyk, J.: Voice query refinement. In: Interspeech (2012)","DOI":"10.21437\/Interspeech.2012-565"},{"issue":"2","key":"22_CR3","first-page":"117","volume":"8","author":"C Allauzen","year":"2003","unstructured":"Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. J. Automata, Lang. Comb. 8(2), 117\u2013144 (2003)","journal-title":"J. Automata, Lang. Comb."},{"key":"22_CR4","unstructured":"Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst Library (2007). http:\/\/www.openfst.org"},{"key":"22_CR5","unstructured":"Breuel, T.M.: The OCRopus open source OCR system. In: Proceedings of IS&T\/SPIE 20th Annual Symposium (2008)"},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"R Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.J.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Camb. Univ. Press, Cambridge (1998)"},{"key":"22_CR7","volume-title":"Automata, Languages and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines. Academic Press, New York (1974)"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the $$k$$ shortest paths. SIAM J. Comp. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comp."},{"key":"22_CR9","unstructured":"Iglesias, G., Allauzen, C., Byrne, W., de Gispert, A., Riley, M.: Hierarchical phrase-based translation representations. In: Proceedings of EMNLP, pp. 1373\u20131383 (2011)"},{"issue":"3","key":"22_CR10","first-page":"331","volume":"20","author":"RM Kaplan","year":"1994","unstructured":"Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Comput. Linguist. 20(3), 331\u2013378 (1994)","journal-title":"Comput. Linguist."},{"issue":"3","key":"22_CR11","first-page":"553","volume":"42","author":"D Kirsten","year":"2008","unstructured":"Kirsten, D.: A Burnside approach to the termination of Mohri\u2019s algorithm for polynomially ambiguous min-plus-automata. ITA 42(3), 553\u2013581 (2008)","journal-title":"ITA"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2011.11.006","volume":"420","author":"D Kirsten","year":"2012","unstructured":"Kirsten, D.: Decidability, undecidability, and pspace-completeness of the twins property in the tropical semiring. Theor. Comput. Sci. 420, 56\u201363 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR13","unstructured":"Kirsten, D., Lombardy, S.: Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata. In: STACS, pp. 589\u2013600 (2009)"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.tcs.2004.02.049","volume":"327","author":"I Klimann","year":"2004","unstructured":"Klimann, I., Lombardy, S., Mairesse, J., Prieur, C.: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theor. Comput. Sci. 327(3), 349\u2013373 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Germany (1986)","DOI":"10.1007\/978-3-642-69959-7_2"},{"issue":"2","key":"22_CR16","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"issue":"6","key":"22_CR17","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1142\/S0129054113400224","volume":"24","author":"M Mohri","year":"2013","unstructured":"Mohri, M.: On the disambiguation of finite automata and functional transducers. Int. J. Found. Comput. Sci. 24(6), 847\u2013862 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: Speech recognition with weighted finite-state transducers. In: Handbook on Speech Proc. and Speech Comm. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-49127-9_28"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Mohri, M., Riley, M.: An efficient algorithm for the n-best-strings problem. In Interspeech (2002)","DOI":"10.21437\/ICSLP.2002-401"},{"key":"22_CR20","unstructured":"Mohri, M., Riley, M.D.: On the disambiguation of weighted automata. ArXiv 1405.0500, May 2014"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Schalkwyk, J., Beeferman, D., Beaufays, F., Byrne, B., Chelba, C., Cohen, M., Kamvar, M., Strope, B.: Your word is my command: Google search by voice: A case study. In: Advances in Speech Recognition, pp. 61\u201390. Springer, Heidelberg (2010)","DOI":"10.1007\/978-1-4419-5951-5_4"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Schmidt, E.M.: Succinctness of description of context-free, regular and unambiguous languages. Ph.D. thesis, Dept. of Comp. Sci., University of Aarhus (1978)","DOI":"10.7146\/dpb.v7i84.6500"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22360-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:41:36Z","timestamp":1674567696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22360-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223599","9783319223605"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22360-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}