{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:37Z","timestamp":1725577417467},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_19","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"173-180","source":"Crossref","is-referenced-by-count":0,"title":["Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization"],"prefix":"10.1007","author":[{"given":"J.","family":"Howard Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(85)90170-7","volume":"40","author":"S.K. Abdali","year":"1985","unstructured":"Abdali, S.K., Saunders, B.D.: Transitive closure and related semiring properties via eliminants. Theoretical Computer Science\u00a040, 257\u2013274 (1985)","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Stanford (2003), \n                  \n                    http:\/\/www.fsmbook.com"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and context-free languages. Teubner, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"19_CR4","volume-title":"Regular algebra and finite machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, London (1971)"},{"key":"19_CR5","unstructured":"Johnson, J.H.: INR\u2014a program for computing finite state automata. INR manual (1988), \n                  \n                    http:\/\/ginr.org"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(89)90068-6","volume":"63","author":"J.H. Johnson","year":"1989","unstructured":"Johnson, J.H.: A unified framework for disambiguating finite transductions. Theoretical Computer Science\u00a063, 91\u2013111 (1989)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","volume":"4","author":"D.J. Lehmann","year":"1977","unstructured":"Lehmann, D.J.: Algebraic structures for transitive closure. Theoretical Computer Science\u00a04(1), 59\u201376 (1977)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"19_CR8","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013312 (1997)","journal-title":"Computational Linguistics"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44674-5_19","volume-title":"Implementation and Application of Automata","author":"M. Mohri","year":"2001","unstructured":"Mohri, M.: Generic \u03b5-removal algorithm for weighted automata. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 230\u2013242. Springer, Heidelberg (2001)"},{"issue":"1","key":"19_CR10","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(1), 17\u201332 (2000)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Generic \u03b5-removal and input \u03b5-normalization algorithms for weighted transducers. International Journal of Foundations of Computer Science (2002)","DOI":"10.1142\/S0129054102000996"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-01492-5_6","volume-title":"Handbook of Weighted Automata","author":"M. Mohri","year":"2009","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch.\u00a06, pp. 213\u2013254. Springer, Berlin (2009)"},{"key":"19_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of automata theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of automata theory. Cambridge University Press, Cambridge (2009)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T02:36:14Z","timestamp":1553394974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}