{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:55Z","timestamp":1725577435741},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_4","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"28-38","source":"Crossref","is-referenced-by-count":6,"title":["Filters for Efficient Composition of Weighted Finite-State Transducers"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Allauzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Riley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Schalkwyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-85780-8_8","volume-title":"Developments in Language Theory","author":"C. Allauzen","year":"2008","unstructured":"Allauzen, C., Mohri, M., Rastogi, A.: General algorithms for testing the ambiguity of finite automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 108\u2013120. Springer, Heidelberg (2008)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Allauzen, C., Mohri, M., Riley, M.: Statistical modeling for unit selection in speech synthesis. In: Proc. ACL, pp. 55\u201362 (2004)","DOI":"10.3115\/1218955.1218963"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-76336-9_3","volume-title":"Implementation and Application of Automata","author":"C. Allauzen","year":"2007","unstructured":"Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst: A general and efficient weighted finite-state transducer library. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 11\u201323. Springer, Heidelberg (2007), http:\/\/www.openfst.org"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. of Computer and System Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. of Computer and System Sci."},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1109\/TSA.2005.860838","volume":"14","author":"D. Caseiro","year":"2006","unstructured":"Caseiro, D., Trancoso, I.: A specialized on-the-fly algorithm for lexicon and language model composition. IEEE Trans. on Audio, Speech and Lang. Proc.\u00a014(4), 1281\u20131291 (2006)","journal-title":"IEEE Trans. on Audio, Speech and Lang. Proc."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, O., Dines, J., Doss, M.: A generalized dynamic composition algorithm of weighted finite state transducers for large vocabulary speech recognition. In: Proc. ICASSP, vol.\u00a04, pp. 345\u2013348 (2007)","DOI":"10.1109\/ICASSP.2007.366920"},{"key":"4_CR7","unstructured":"Dom, M., Niedermeier, R.: The search for consecutive ones submatrices: Faster and more general. In: Proc. ACID, pp. 43\u201354 (2007)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci.\u00a0234, 59\u201384 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W.-L. Hsu","year":"2003","unstructured":"Hsu, W.-L., McConnell, R.: PC trees and circular-ones arrangements. Theor. Comput. Sci.\u00a0296(1), 99\u2013116 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"McDonough, J., Stoimenov, E., Klakow, D.: An algorithm for fast composition of weighted finite-state transducers. In: Proc. ASRU (2007)","DOI":"10.1109\/ASRU.2007.4430156"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0166-218X(98)00078-X","volume":"88","author":"J. Meidanis","year":"1998","unstructured":"Meidanis, J., Porto, O., Telles, G.: On the consecutive ones property. Discrete Appl. Math.\u00a088, 325\u2013354 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"4_CR12","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(3), 321\u2013350 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-540-49127-9_28","volume-title":"Handbook of Speech Processing","author":"M. Mohri","year":"2008","unstructured":"Mohri, M., Pereira, F., Riley, M.: Speech recognition with weighted finite-state transducers. In: Jacob Benesty, Y.H., Sondhi, M. (eds.) Handbook of Speech Processing, pp. 559\u2013582. Springer, Heidelberg (2008)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Oonishi, T., Dixon, P., Iwano, K., Furui, S.: Implementation and evaluation of fast on-the-fly WFST composition algorithms. In: Proc. Interspeech, pp. 2110\u20132113 (2008)","DOI":"10.1109\/ICASSP.2009.4960584"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T06:18:34Z","timestamp":1559974714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}