Synchronous Context-Free Tree Grammars

We consider pairs of context-free tree grammars combined through synchronous rewriting. The resulting formalism is at least as powerful as synchronous tree adjoining grammars and linear, nondeleting macro tree transducers, while the parsing complexity remains polynomial. Its power is subsumed by context-free hypergraph grammars. The new formalism has an alternative characterization in terms of bimorphisms. An advantage over synchronous variants of linear context-free rewriting systems is the ability to specify tree-to-tree transductions.

[1]  Mark-Jan Nederhof,et al.  On the Complexity of Some Extensions of RCG Parsing , 2001, IWPT.

[2]  David J. Weir,et al.  Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.

[3]  李幼升,et al.  Ph , 1989 .

[4]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes II , 1982, Theor. Comput. Sci..

[5]  Stuart M. Shieber,et al.  Synchronous Tree-Adjoining Grammars , 1990, COLING.

[6]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes I , 1982, Theoretical Computer Science.

[7]  Donald E. Knuth,et al.  Semantics of context-free languages , 1968, Mathematical systems theory.

[8]  Makoto Kanazawa.  The Pumping Lemma for Well-Nested Multiple Context-Free Languages , 2009, Developments in Language Theory.

[9]  Joost Engelfriet,et al.  SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES , 1980 .

[10]  james w.thatcher,et al.  tree automata: an informal survey , 1974 .

[11]  Giorgio Satta,et al.  Synchronous Rewriting in Treebanks , 2009, IWPT.

[12]  Annegret Habel,et al.  Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement , 1987, STACS.

[13]  Stuart M. Shieber.  Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms , 2006, EACL.

[14]  Stuart M. Shieber,et al.  Synchronous Grammars as Tree Transducers , 2004, TAG+.

[15]  Andreas Maletti.  How to train your multi bottom-up tree transducer , 2011, ACL.

[16]  David Chiang,et al.  Hierarchical Phrase-Based Translation , 2007, CL.

[17]  Richard Edwin Stearns,et al.  Syntax-Directed Transduction , 1966, JACM.

[18]  Joost Engelfriet,et al.  The String Generating Power of Context-Free Hypergraph Grammars , 1991, J. Comput. Syst. Sci..

[19]  Max Dauchet,et al.  Morphismes et Bimorphismes d'Arbres , 1982, Theor. Comput. Sci..

[20]  Zoltán Fülöp,et al.  Weighted Extended Tree Transducers , 2011, Fundam. Informaticae.

[21]  Aravind K. Joshi,et al.  Mathematical and computational aspects of lexicalized grammars , 1990 .

[22]  Alfred V. Aho,et al.  Properties of Syntax Directed Translations , 1969, J. Comput. Syst. Sci..

[23]  William C. Rounds,et al.  Mappings and grammars on trees , 1970, Mathematical systems theory.

[24]  Andreas Maletti,et al.  Every sensible extended top-down tree transducer is a multi bottom-up tree transducer , 2012, NAACL.

[25]  Joost Engelfriet,et al.  Strong Lexicalization of Tree Adjoining Grammars , 2012, ACL.

[26]  Daniel Götzmann.  Multiple Context-Free Grammars , 2007 .

[27]  Mark Hopkins,et al.  The Power of Extended Top-Down Tree Transducers , 2009, SIAM J. Comput..

[28]  J. Engelfriet,et al.  IO and OI , 1975 .

[29]  Alfred V. Aho,et al.  Syntax Directed Translations and the Pushdown Assembler , 1969, J. Comput. Syst. Sci..

[30]  Joost Engelfriet,et al.  Composition and Decomposition of Extended Multi Bottom-Up Tree Transducers ? , 2008 .

[31]  Heiko Vogler,et al.  Tree Parsing with Synchronous Tree-Adjoining Grammars , 2011, IWPT.

[32]  Dekai Wu,et al.  Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora , 1997, CL.

[33]  Zoltán Fülöp,et al.  Preservation of Recognizability for Synchronous Tree Substitution Grammars , 2010, ATANLP@ACL 2010.

[34]  Heiko Vogler,et al.  Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars , 2012, Developments in Language Theory.

[35]  Anatoliy O. Buda,et al.  Generalized1.5 Sequential Machine Maps , 1979, Inf. Process. Lett..

[36]  Bruno Courcelle,et al.  Graph expressions and graph rewritings , 1987, Mathematical systems theory.

[37]  David J. Weir,et al.  Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing , 2011, CL.

[38]  Kevin Knight,et al.  An Overview of Probabilistic Tree Transducers for Natural Language Processing , 2005, CICLing.

[39]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..