{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:29:10Z","timestamp":1725460150110},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_6","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"66-77","source":"Crossref","is-referenced-by-count":7,"title":["A Pushdown Transducer Extension for the OpenFst Library"],"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"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling, vol.\u00a01-2. Prentice-Hall (1972)"},{"key":"6_CR2","unstructured":"Allauzen, C., Riley, M.: Pushdown Transducers (2011), \n                    \n                      http:\/\/pdt.openfst.org"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-18098-9_4","volume-title":"Implementation and Application of Automata","author":"C. Allauzen","year":"2011","unstructured":"Allauzen, C., Riley, M., Schalkwyk, J.: Filters for Efficient Composition of Weighted Finite-State Transducers. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 28\u201338. Springer, Heidelberg (2011)"},{"key":"6_CR4","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), \n                    \n                      http:\/\/www.openfst.org"},{"key":"6_CR5","unstructured":"Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. In: Bar-Hillel, Y. (ed.) Language and Information: Selected Essays on their Theory and Application, pp. 116\u2013150. Addison-Wesley (1964)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"6_CR7","unstructured":"Chen, S.F.: Designing a non-finite-state weighted transducer toolkit. Technical Report RC 24829, IBM Research Division (2009)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1162\/coli.2007.33.2.201","volume":"33","author":"D. Chiang","year":"2007","unstructured":"Chiang, D.: Hierarchical phrase-based translation. Computational Linguistics\u00a033(2), 201\u2013228 (2007)","journal-title":"Computational Linguistics"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Drosde, M., Kuick, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"6_CR10","unstructured":"Hall, K., Johnson, M.: Language modeling using efficient best-first bottom-up parsing. In: Proceedings of ASRU (2003)"},{"key":"6_CR11","unstructured":"Iglesias, G., Allauzen, C., Byrne, W., de Gispert, A., Riley, M.: Hierarchical phrase-based translation representations. In: Proc. EMNLP, pp. 1373\u20131383 (2011)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Kuich, W., Salomaa, A.: Semirings, automata, languages. Springer (1986)","DOI":"10.1007\/978-3-642-69959-7"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-06841-4_65","volume-title":"Automata, Languages and Programming","author":"B. Lang","year":"1974","unstructured":"Lang, B.: Deterministic Techniques for Efficient Non-Deterministic Parsers. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol.\u00a014, pp. 255\u2013269. Springer, Heidelberg (1974)"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00989665","volume":"8","author":"F.J. Maryanski","year":"1979","unstructured":"Maryanski, F.J., Thomason, M.G.: Properties of stochastic syntax-directed translation schemata. International Journal of Computer and Information Sciences\u00a08(2), 89\u2013110 (1979)","journal-title":"International Journal of Computer and Information Sciences"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Weighted grammar tools: the GRM library. In: Robustness in Language and Speech Technology, pp. 165\u2013186. Kluwer (2001)","DOI":"10.1007\/978-94-015-9719-7_7"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Weighted automata algorithms. In: Drosde, et al. [9], ch. 6, pp. 213\u2013254","DOI":"10.1007\/978-3-642-01492-5_6"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M. Mohri","year":"2002","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: Weighted finite-state transducers in speech recognition. Computer Speech and Language\u00a016(1), 69\u201388 (2002)","journal-title":"Computer Speech and Language"},{"key":"6_CR18","unstructured":"Nederhof, M.-J., Satta, G.: Probabilistic parsing as intersection. In: Proceedings of 8th International Workshop on Parsing Technologies, pp. 137\u2013148 (2003)"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/1147954.1147959","volume":"53","author":"M.J. Nederhof","year":"2006","unstructured":"Nederhof, M.J., Satta, G.: Probabilistic parsing strategies. Journal of the ACM\u00a053(3), 406\u2013436 (2006)","journal-title":"Journal of the ACM"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Petre, I., Salomaa, A.: Algebraic systems and pushdown automata. In: Drosde, et al [9], ch. 7, pp. 257\u2013289","DOI":"10.1007\/978-3-642-01492-5_7"},{"issue":"2","key":"6_CR21","first-page":"165","volume":"21","author":"A. Stolcke","year":"1995","unstructured":"Stolcke, A.: An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics\u00a021(2), 165\u2013201 (1995)","journal-title":"Computational Linguistics"}],"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-31606-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:06Z","timestamp":1620128406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}