{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:28:21Z","timestamp":1725560901617},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146831"},{"type":"electronic","value":"9783642146848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14684-8_8","type":"book-chapter","created":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T11:52:18Z","timestamp":1279972338000},"page":"69-80","source":"Crossref","is-referenced-by-count":1,"title":["Compositions of Top-Down Tree Transducers with \u03b5-Rules"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[]},{"given":"Heiko","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Introduction to automata theory, languages, and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)"},{"key":"8_CR2","first-page":"209","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, pp. 209\u2013252. Springer, Heidelberg (2009)"},{"issue":"1","key":"8_CR3","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.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theoret. Comput. Sci.\u00a0231(1), 17\u201332 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR4","first-page":"331","volume":"20","author":"R.M. Kaplan","year":"1994","unstructured":"Kaplan, R.M., May, M.: Regular models of phonological rule systems. Computational Linguistics\u00a020(3), 331\u2013378 (1994)","journal-title":"Computational Linguistics"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Kanthak, S., Ney, H.: Fsa: an efficient and flexible C\u2009+\u2009+\u2009 toolkit for finite state automata using on-demand computation. In: Proc. ACL, pp. 510\u2013517 (2004)","DOI":"10.3115\/1218955.1219020"},{"key":"8_CR6","unstructured":"Graehl, J.: Carmel: finite-state toolkit. ISI\/USC (1997), http:\/\/www.isi.edu\/licensed-sw\/carmel\/"},{"key":"8_CR7","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 \u2014 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)"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theory\u00a04(3), 257\u2013287 (1970)","journal-title":"Math. Syst. Theory"},{"issue":"4","key":"8_CR9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","volume":"4","author":"J.W. Thatcher","year":"1970","unstructured":"Thatcher, J.W.: Generalized2 sequential machine maps. J. Comput. Syst. Sci.\u00a04(4), 339\u2013367 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR10","unstructured":"Arnold, A., Dauchet, M.: Transductions inversibles de for\u00eats. Th\u00e8se 3\u00e8me cycle M.\u00a0Dauchet, Universit\u00e9 de Lille (1975)"},{"key":"8_CR11","first-page":"74","volume-title":"Proc. ICALP","author":"A. Arnold","year":"1976","unstructured":"Arnold, A., Dauchet, M.: Bi-transductions de for\u00eats. In: Proc. ICALP, pp. 74\u201386. Cambridge University Press, Cambridge (1976)"},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1162\/coli.2008.07-051-R2-03-57","volume":"34","author":"J. Graehl","year":"2008","unstructured":"Graehl, J., Knight, K., May, J.: Training tree transducers. Computational Linguistics\u00a034(3), 391\u2013427 (2008)","journal-title":"Computational Linguistics"},{"key":"8_CR13","unstructured":"Shabes, Y.: Mathematical and computational aspects of lexicalized grammars. PhD thesis, University of Pennsylvania (1990)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Shieber, S.M., Schabes, Y.: Synchronous tree-adjoining grammars. In: Proc. ACL, pp. 253\u2013258 (1990)","DOI":"10.3115\/991146.991191"},{"key":"8_CR15","unstructured":"Lilin, E.: Une g\u00e9n\u00e9ralisation des transducteurs d\u2019\u00e9tats finis d\u2019arbres: les S-transducteurs. Th\u00e8se 3\u00e8me cycle, Universit\u00e9 de Lille (1978)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-10828-9_69","volume-title":"CAAP \u201981","author":"E. Lilin","year":"1981","unstructured":"Lilin, E.: Propri\u00e9t\u00e9s de cl\u00f4ture d\u2019une extension de transducteurs d\u2019arbres d\u00e9terministes. In: Astesiano, E., B\u00f6hm, C. (eds.) CAAP 1981. LNCS, vol.\u00a0112, pp. 280\u2013289. Springer, Heidelberg (1981)"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ipl.2004.03.014","volume":"91","author":"Z. F\u00fcl\u00f6p","year":"2004","unstructured":"F\u00fcl\u00f6p, Z., K\u00fchnemann, A., Vogler, H.: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett.\u00a091(2), 57\u201367 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"1-2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.tcs.2005.07.025","volume":"347","author":"Z. F\u00fcl\u00f6p","year":"2005","unstructured":"F\u00fcl\u00f6p, Z., K\u00fchnemann, A., Vogler, H.: Linear deterministic multi bottom-up tree transducers. Theoret. Comput. Sci.\u00a0347(1-2), 276\u2013287 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-85780-8_23","volume-title":"Developments in Language Theory","author":"J. Engelfriet","year":"2008","unstructured":"Engelfriet, J., Lilin, E., Maletti, A.: Extended multi bottom-up tree transducers. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 289\u2013300. Springer, Heidelberg (2008)"},{"key":"8_CR20","unstructured":"Shieber, S.M.: Synchronous grammars as tree transducers. In: Proc. TAG+7, pp. 88\u201395 (2004)"},{"issue":"9-10","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1016\/j.ic.2008.03.019","volume":"206","author":"A. Maletti","year":"2008","unstructured":"Maletti, A.: Compositions of extended top-down tree transducers. Inf. Comput.\u00a0206(9-10), 1187\u20131196 (2008)","journal-title":"Inf. Comput."},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30586-6_1","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"K. Knight","year":"2005","unstructured":"Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol.\u00a03406, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"8_CR23","first-page":"555","volume-title":"Handbook of Weighted Automata","author":"K. Knight","year":"2009","unstructured":"Knight, K., May, J.: Applications of Weighted Automata in Natural Language Processing. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 555\u2013580. Springer, Heidelberg (2009)"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11812128_11","volume-title":"Implementation and Application of Automata","author":"J. May","year":"2006","unstructured":"May, J., Knight, K.: Tiburon: A weighted tree automata toolkit. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 102\u2013113. Springer, Heidelberg (2006)"},{"issue":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/070699160","volume":"39","author":"A. Maletti","year":"2009","unstructured":"Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput.\u00a039(2), 410\u2013430 (2009)","journal-title":"SIAM J. Comput."},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Yamada, K., Knight, K.: A decoder for syntax-based statistical MT. In: ACL, pp. 303\u2013310 (2002)","DOI":"10.3115\/1073083.1073134"},{"issue":"2","key":"8_CR27","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","volume":"41","author":"B.S. Baker","year":"1979","unstructured":"Baker, B.S.: Composition of top-down and bottom-up tree transformations. Inform. Control\u00a041(2), 186\u2013213 (1979)","journal-title":"Inform. Control"},{"issue":"3","key":"8_CR28","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"Engelfriet, J.: Bottom-up and top-down tree transformations\u2014a comparison. Math. Systems Theory\u00a09(3), 198\u2013231 (1975)","journal-title":"Math. Systems Theory"},{"key":"8_CR29","doi-asserted-by":"crossref","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. Teubner, Stuttgart (1979)"},{"key":"8_CR30","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"8_CR31","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"key":"8_CR32","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-60207-8_13","volume-title":"Jewels Are Forever","author":"W. Kuich","year":"1999","unstructured":"Kuich, W.: Full abstract families of tree series I. In: Jewels Are Forever, pp. 145\u2013156. Springer, Heidelberg (1999)"},{"key":"8_CR33","unstructured":"Heger, C.: Composition of linear and nondeleting top-down tree transducers with \u03b5-rules. Master\u2019s thesis, TU\u00a0Dresden (2008)"},{"issue":"2","key":"8_CR34","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10590-008-9039-0","volume":"21","author":"K. Knight","year":"2007","unstructured":"Knight, K.: Capturing practical natural language transformations. Machine Translation\u00a021(2), 121\u2013133 (2007)","journal-title":"Machine Translation"},{"key":"8_CR35","unstructured":"Knight, K.: Requirements on an MT\u00a0system. Personal communication (2008)"}],"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\/978-3-642-14684-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:56:31Z","timestamp":1606186591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14684-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146831","9783642146848"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14684-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}