{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:10:21Z","timestamp":1743084621293,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_23","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"289-300","source":"Crossref","is-referenced-by-count":4,"title":["Extended Multi Bottom-Up Tree Transducers"],"prefix":"10.1007","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[]},{"given":"Eric","family":"Lilin","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Maletti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Knight, K.: Criteria for reasonable syntax-based translation models. Personal communication (2007)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","first-page":"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":"23_CR3","unstructured":"DeNeefe, S., Knight, K., Wang, W., Marcu, D.: What can syntax-based MT learn from phrase-based MT? In: EMNLP & CoNLL, pp. 755\u2013763 (2007)"},{"key":"23_CR4","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":"23_CR5","unstructured":"Graehl, J., Knight, K.: Training tree transducers. In: HLT-NAACL, pp. 105\u2013112 (2004)"},{"key":"23_CR6","unstructured":"Arnold, A., Dauchet, M.: Transductions inversibles de for\u00eats. Th\u00e8se 3\u00e8me cycle M.\u00a0Dauchet, Universit\u00e9 de Lille (1975)"},{"key":"23_CR7","unstructured":"Arnold, A., Dauchet, M.: Bi-transductions de for\u00eats. In: ICALP, pp. 74\u201386. Edinburgh University Press (1976)"},{"issue":"3","key":"23_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. Systems Theory\u00a04(3), 257\u2013287 (1970)","journal-title":"Math. Systems Theory"},{"issue":"4","key":"23_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. System Sci.\u00a04(4), 339\u2013367 (1970)","journal-title":"J. Comput. System Sci."},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-76336-9_25","volume-title":"Implementation and Application of Automata","author":"M. Steinby","year":"2007","unstructured":"Steinby, M., T\u00eern\u0103uc\u0103, C.I.: Syntax-directed translations and quasi-alphabetic tree bimorphisms. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 265\u2013276. Springer, Heidelberg (2007)"},{"issue":"1","key":"23_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0022-0000(69)80006-1","volume":"3","author":"A.V. Aho","year":"1969","unstructured":"Aho, A.V., Ullman, J.D.: Syntax directed translations and the pushdown assembler. J. Comput. System Sci.\u00a03(1), 37\u201356 (1969)","journal-title":"J. Comput. System Sci."},{"key":"23_CR12","unstructured":"Shabes, Y.: Mathematical and Computational Aspects of Lexicalized Grammars. PhD thesis, University of Pennsylvania (1990)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Shieber, S.M., Shabes, Y.: Synchronous tree-adjoining grammars. In: COLING, pp. 1\u20136 (1990)","DOI":"10.3115\/991146.991191"},{"key":"23_CR14","unstructured":"Shieber, S.M.: Unifying synchronous tree adjoining grammars and tree transducers via bimorphisms. In: EACL. The Association for Computer Linguistics, pp. 377\u2013384 (2006)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(82)90098-6","volume":"20","author":"A. Arnold","year":"1982","unstructured":"Arnold, A., Dauchet, M.: Morphismes et bimorphismes d\u2019arbres. Theoret. Comput. Sci.\u00a020, 33\u201393 (1982)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"23_CR16","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\u20132","key":"23_CR17","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\u20132), 276\u2013287 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Maletti, A.: Compositions of extended top-down tree transducers. Inform. and Comput. (to appear, 2008)","DOI":"10.1016\/j.ic.2008.03.019"},{"issue":"3","key":"23_CR19","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: A comparison. Math. Systems Theory\u00a09(3), 198\u2013231 (1975)","journal-title":"Math. Systems Theory"},{"issue":"2","key":"23_CR20","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 transductions. Inform. and Control\u00a041(2), 186\u2013213 (1979)","journal-title":"Inform. and Control"},{"key":"23_CR21","first-page":"143","volume-title":"Currents in the Theory of Computing","author":"J.W. Thatcher","year":"1973","unstructured":"Thatcher, J.W.: Tree automata: An informal survey. In: Currents in the Theory of Computing, pp. 143\u2013172. Prentice Hall, Englewood Cliffs (1973)"},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6423(83)90021-7","volume":"3","author":"H. Ganzinger","year":"1983","unstructured":"Ganzinger, H.: Increasing modularity and language-independency in automatically generated compilers. Sci. Comput. Prog.\u00a03(3), 223\u2013278 (1983)","journal-title":"Sci. Comput. Prog."},{"issue":"4","key":"23_CR23","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF02737108","volume":"25","author":"R. Giegerich","year":"1988","unstructured":"Giegerich, R.: Composition and evaluation of attribute coupled grammars. Acta Inform.\u00a025(4), 355\u2013423 (1988)","journal-title":"Acta Inform."},{"key":"23_CR24","unstructured":"K\u00fchnemann, A.: Berechnungsst\u00e4rken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis, Technische Universit\u00e4t Dresden (1997)"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-540-49382-2_13","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. K\u00fchnemann","year":"1998","unstructured":"K\u00fchnemann, A.: Benefits of tree transducers for optimizing functional programs. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 146\u2013157. Springer, Heidelberg (1998)"},{"issue":"1","key":"23_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1999.2807","volume":"154","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput.\u00a0154(1), 34\u201391 (1999)","journal-title":"Inform. and Comput."},{"issue":"1","key":"23_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory\u00a010(1), 289\u2013303 (1977)","journal-title":"Math. Systems Theory"},{"key":"23_CR28","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"23_CR29","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":"23_CR30","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":"23_CR31","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)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:23:44Z","timestamp":1676679824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}