{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:08Z","timestamp":1725745388627},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406621"},{"type":"electronic","value":"9783642406638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40663-8_22","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T21:03:57Z","timestamp":1376946237000},"page":"235-246","source":"Crossref","is-referenced-by-count":0,"title":["Synchronous Forest Substitution Grammars"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","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. Theor. Comput. Sci.\u00a020(1), 33\u201393 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR2","unstructured":"Chiang, D.: An introduction to synchronous grammars. In: Proc. 44th ACL. Association for Computational Linguistics (2006), Part of a tutorial given with K. Knight"},{"key":"22_CR3","unstructured":"Dauchet, M.: Transductions de for\u00eats \u2014 Bimorphismes de magmo\u00efdes. Premi\u00e8re th\u00e8se, Universit\u00e9 de Lille (1977)"},{"issue":"8","key":"22_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00236-009-0105-8","volume":"46","author":"J. Engelfriet","year":"2009","unstructured":"Engelfriet, J., Lilin, E., Maletti, A.: Composition and decomposition of extended multi bottom-up tree transducers. Acta Informatica\u00a046(8), 561\u2013590 (2009)","journal-title":"Acta Informatica"},{"issue":"2","key":"22_CR5","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":"22_CR6","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. Theor. Comput. Sci.\u00a0347(1-2), 276\u2013287 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR7","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 1\u201368. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_1"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/COLI_a_00108","volume":"38","author":"D. Gildea","year":"2012","unstructured":"Gildea, D.: On the string translations produced by multi bottom-up tree transducers. Computational Linguistics\u00a038(3), 673\u2013693 (2012)","journal-title":"Computational Linguistics"},{"key":"22_CR10","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":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"9-10","key":"22_CR12","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. Inform. and Comput.\u00a0206(9-10), 1187\u20131196 (2008)","journal-title":"Inform. and Comput."},{"key":"22_CR13","unstructured":"Maletti, A.: Why synchronous tree substitution grammars? In: Proc. HLT-NAACL. Association for Computational Linguistics, pp. 876\u2013884 (2010)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1017\/S1351324911000027","volume":"17","author":"A. Maletti","year":"2011","unstructured":"Maletti, A.: An alternative to synchronous tree substitution grammars. J. Nat. Lang. Engrg.\u00a017(2), 221\u2013242 (2011)","journal-title":"J. Nat. Lang. Engrg."},{"key":"22_CR15","unstructured":"Maletti, A.: How to train your multi bottom-up tree transducer. In: Proc. 49th ACL, pp. 825\u2013834. Association for Computational Linguistics (2011)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-540-77566-9_37","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"F.G. Radmacher","year":"2008","unstructured":"Radmacher, F.G.: An automata theoretic approach to rational tree relations. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 424\u2013435. Springer, Heidelberg (2008)"},{"issue":"1","key":"22_CR17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.36045\/bbms\/1105730627","volume":"4","author":"J.C. Raoult","year":"1997","unstructured":"Raoult, J.C.: Rational tree relations. Bull. Belg. Math. Soc. Simon Stevin\u00a04(1), 149\u2013176 (1997)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H. Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science\u00a088(2), 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Sun, J., Zhang, M., Tan, C.L.: A non-contiguous tree sequence alignment-based model for statistical machine translation. In: Proc. 47th ACL, pp. 914\u2013922. Association for Computational Linguistics (2009)","DOI":"10.3115\/1690219.1690275"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proc. 25th ACL, pp. 104\u2013111. Association for Computational Linguistics (1987)","DOI":"10.3115\/981175.981190"},{"key":"22_CR21","unstructured":"Zhang, M., Jiang, H., Aw, A., Li, H., Tan, C.L., Li, S.: A tree sequence alignment-based tree-to-tree translation model. In: Proc. 46th ACL, pp. 559\u2013567. Association for Computational Linguistics (2008)"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, M., Jiang, H., Li, H., Aw, A., Li, S.: Grammar comparison study for translational equivalence modeling and statistical machine translation. In: Proc. 22nd CoLing, pp. 1097\u20131104. Association for Computational Linguistics (2008)","DOI":"10.3115\/1599081.1599219"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40663-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T02:17:51Z","timestamp":1596334671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40663-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406621","9783642406638"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40663-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}