{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:47:19Z","timestamp":1725475639979},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354673"},{"type":"electronic","value":"9783540354697"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780885_12","type":"book-chapter","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T17:13:38Z","timestamp":1165857218000},"page":"110-119","source":"Crossref","is-referenced-by-count":0,"title":["Collapsing \u03b5-Loops in Weighted Finite-State Machines"],"prefix":"10.1007","author":[{"given":"J. Howard","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","volume":"15","author":"R.C. Backhouse","year":"1975","unstructured":"Backhouse, R.C., Carr\u00e9, B.A.: Regular Algebra applied to path-finding problems. Journal of the Institute of Mathematics and its Applications\u00a015, 161\u2013186 (1975)","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"12_CR2","series-title":"CSLI Studies in Computational Linguistics","volume-title":"Finite State Morphology","author":"K.R. Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003), http:\/\/www.fsmbook.com"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and context-free languages. BG Teubner, Stuttgart (1979)"},{"key":"12_CR4","volume-title":"Computer solution of large sparse positive definite systems","author":"A. George","year":"1981","unstructured":"George, A., Liu, J.W.: Computer solution of large sparse positive definite systems. Prentice-Hall, Englewood Cliff (1981)"},{"key":"12_CR5","unstructured":"Johnson, J.H.: INR - a program for computing finite state automata (unpublished manuscript, 1986)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45089-0_11","volume-title":"Implementation and Application of Automata","author":"A. Kempe","year":"2003","unstructured":"Kempe, A., Baeijs, C., Ga\u00e1l, T., Guingne, F., Nicart, F.: WFSC - a new weighted finite state compiler. In: H. Ibarra, O., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 108\u2013120. Springer, Heidelberg (2003)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Kumar, S., Byrne, W.: A weighted finite state transducer implementation of the alignment template model for statistical machine translation. In: Proceedings of HLT-NAACL 2003, Edmonton, Canada, pp. 142\u2013149 (2003)","DOI":"10.3115\/1073445.1073464"},{"issue":"2","key":"12_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":"12_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)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Generic \u03b5-removal and input \u03b5-normalization algorithms for weighted transducers (2002)","DOI":"10.1142\/S0129054102000996"},{"issue":"1","key":"12_CR11","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":"12_CR12","doi-asserted-by":"crossref","first-page":"431","DOI":"10.7551\/mitpress\/3007.003.0017","volume-title":"Finite-state Language Processing","author":"F. Pereira","year":"1997","unstructured":"Pereira, F., Riley, M.: Speech recognition by composition of weighted finite automata. In: Roche, E., Schabes, Y. (eds.) Finite-state Language Processing, pp. 431\u2013453. The MIT Press, Cambridge (1997)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Rose, D.J., Tarjan, R.E.: Algorithmic aspects of vertex elimination. In: Proceedings of the 7th ACM Symposium on the Theory of Computing (STOC 1975), pp. 245\u2013254 (1975)","DOI":"10.1145\/800116.803775"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. Journal of the ACM\u00a028(3), 594\u2013614 (1981)","journal-title":"Journal of the ACM"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1162\/089120100561638","volume":"26","author":"G. Noord van","year":"2000","unstructured":"van Noord, G.: Treatment of epsilon moves in subset construction. Computational Linguistics\u00a026(1), 61\u201376 (2000)","journal-title":"Computational Linguistics"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45526-4_12","volume-title":"Automata Implementation","author":"G. Noord van","year":"2001","unstructured":"van Noord, G., Gerdemann, D.: An extendible regular expression compiler for finite-state approaches in natural language processing. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, p. 122. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780885_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T21:54:57Z","timestamp":1707429297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780885_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354673","9783540354697"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11780885_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}