Hybrid Grammars for Discontinuous Parsing

We introduce the concept of hybrid grammars, which are extensions of synchronous grammars, obtained by coupling of lexical elements. One part of a hybrid grammar generates linear structures, another generates hierarchical structures, and together they generate discontinuous structures. This formalizes and generalizes some existing mechanisms for dealing with discontinuous phrase structures and non-projective dependency structures. Moreover, it allows us to separate the degree of discontinuity from the time complexity of parsing.

[1]  Ingrid Fischer,et al.  Parsing String Generating Hypergraph Grammars , 2004, ICGT.

[2]  Alexis Nasr,et al.  Pseudo-Projectivity, A Polynomially Parsable Non-Projective Dependency Grammar , 1998, ACL.

[3]  Giorgio Satta,et al.  An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two , 2009, ACL/IJCNLP.

[4]  Fernando Pereira,et al.  Online Learning of Approximate Dependency Parsing Algorithms , 2006, EACL.

[5]  Laura Kallmeyer,et al.  PLCFRS Parsing of English Discontinuous Constituents , 2011, IWPT.

[6]  Joakim Nivre,et al.  Pseudo-Projective Dependency Parsing , 2005, ACL.

[7]  J. McCawley.  Parentheticals and discontinuous constituent structure , 1982 .

[8]  Laura Kallmeyer,et al.  A Formal Model for Plausible Dependencies in Lexicalized Tree Adjoining Grammar , 2012, TAG.

[9]  Giorgio Satta,et al.  Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems , 2009, NAACL.

[10]  Adriane Boyd,et al.  Discontinuity Revisited: An Improved Conversion to Context-Free Representations , 2007, LAW@ACL.

[11]  Mark Johnson,et al.  A Simple Pattern-matching Algorithm for Recovering Empty Nodes and their Antecedents , 2002, ACL.

[12]  Robert Giegerich,et al.  Composition and evaluation of attribute coupled grammars , 1988, Acta Informatica.

[13]  Khalil Sima'an,et al.  Efficient Disambiguation by means of Stochastic Tree Substitution Grammars , 1994 .

[14]  Owen Rambow.  The Simple Truth about Dependency and Phrase Structure Representations: An Opinion Piece , 2010, HLT-NAACL.

[15]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[16]  Giorgio Satta,et al.  Some Computational Complexity Results for Synchronous Context-Free Grammars , 2005, HLT/EMNLP.

[17]  Wolfgang Lezius,et al.  TIGER: Linguistic Interpretation of a German Corpus , 2004 .

[18]  Beatrice Santorini,et al.  Building a Large Annotated Corpus of English: The Penn Treebank , 1993, CL.

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

[20]  Joakim Nivre,et al.  Non-Projective Dependency Parsing in Expected Linear Time , 2009, ACL.

[21]  Hiroyuki Seki,et al.  On the Generative Power of Multiple Context-Free Grammars and Macro Grammars , 2008, IEICE Trans. Inf. Syst..

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

[23]  Aravind K. Joshi,et al.  Some Computational Properties of Tree Adjoining Grammars , 1985, Annual Meeting of the Association for Computational Linguistics.

[24]  Gregor von Bochmann,et al.  Semantic evaluation from left to right , 1976, CACM.

[25]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[26]  Timm Lichte,et al.  Characterizing Discontinuity in Constituent Treebanks , 2009, FG.

[27]  Jan Maluszynski,et al.  Relating Logic Programs and Attribute Grammars , 1985, J. Log. Program..

[28]  Harry Bunt,et al.  Formal tools for describing and processing discontinuous constituency structure , 1996 .

[29]  Andreas Kathol,et al.  Extraposition via Complex Domain Formation , 1995, ACL.

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

[31]  Aravind K. Joshi,et al.  Some Computational Properties of Tree Adjoining Grammars , 1985, ACL.

[32]  Marco Kuhlmann,et al.  Mildly Non-Projective Dependency Grammar , 2013, CL.

[33]  Seth Kulick,et al.  Fully Parsing the Penn Treebank , 2006, NAACL.

[34]  Andreas van Cranenburgh.  Efficient parsing with Linear Context-Free Rewriting Systems , 2012, EACL.

[35]  Stefan Müller,et al.  Continuous or Discontinuous Constituents? A Comparison between Syntactic Analyses for Constituent Order and Their Processing Systems , 2004 .

[36]  Aravind K. Joshi,et al.  Long-Distance Scrambling and Tree Adjoining Grammars , 1991, EACL.

[37]  Aravind K. Joshi,et al.  A Formal Look at Dependency Grammars and Phrase-Structure Grammars, with Special Consideration of Word-Order Phenomena , 1994, ArXiv.

[38]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[39]  Stuart M. Shieber,et al.  Evidence against the context-freeness of natural language , 1985 .

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

[41]  Richard Campbell,et al.  Using Linguistic Principles to Recover Empty Categories , 2004, ACL.

[42]  Stanley Peters,et al.  Cross-Serial Dependencies in Dutch , 1982 .

[43]  Martha Palmer,et al.  Robust Constituent-to-Dependency Conversion for English , 2010 .

[44]  Hwee Tou Ng,et al.  A Generative Model for Parsing Natural Language to Meaning Representations , 2008, EMNLP.

[45]  Laura Kallmeyer,et al.  Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems , 2010, COLING.