Dependency Structures and

[1]  David J. Weir,et al.  D-Tree Grammars , 1995, ACL.

[2]  Jürgen Kunze,et al.  Die Auslassbarkeit von Satzteilen bei koordinativen Verbindungen im Deutschen , 1972 .

[3]  Giorgio Satta,et al.  Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars , 1999, ACL.

[4]  Jason Eisner,et al.  Three New Probabilistic Models for Dependency Parsing: An Exploration , 1996, COLING.

[5]  Marco Kuhlmann,et al.  Dependency Structures Derived from Minimalist Grammars , 2007, MOL.

[6]  Haim Gaifman,et al.  Dependency Systems and Phrase-Structure Systems , 1965, Inf. Control..

[7]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[8]  Stuart M. Shieber,et al.  Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..

[9]  Uwe Mönnich,et al.  Closure properties of linear context-free tree languages with an application to optimality theory , 2006, Theor. Comput. Sci..

[10]  Sabine Buchholz,et al.  CoNLL-X Shared Task on Multilingual Dependency Parsing , 2006, CoNLL.

[11]  Jirí Havelka.  Projectivity in Totally Ordered Rooted Trees , 2005, Prague Bull. Math. Linguistics.

[12]  Marcus Kracht,et al.  The mathematics of language , 2003 .

[13]  Giorgio Satta,et al.  Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems , 2010, HLT-NAACL.

[14]  Joakim Nivre,et al.  Algorithms for Deterministic Incremental Dependency Parsing , 2008, CL.

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

[16]  Eva Hajicová,et al.  Condition of Projectivity in the Underlying Dependency Structures , 2004, COLING.

[17]  Jirí Havelka.  Beyond Projectivity: Multilingual Evaluation of Constraints and Measures on Non-Projective Structures , 2007, ACL.

[18]  Marco Kuhlmann,et al.  Extended Cross-Serial Dependencies in Tree Adjoining Grammars , 2006, TAG.

[19]  Marcus Kracht,et al.  Semilinearity as a Syntactic Invariant , 1996, LACL.

[20]  Michael A. Covington,et al.  A Fundamental Algorithm for Dependency Parsing , 2004 .

[21]  Alexander Koller,et al.  Dependency Trees and the Strong Generative Capacity of CCG , 2009, EACL.

[22]  Sylvain Kahane,et al.  Can the TAG derivation tree represent a semantic graph? An answer in the light of Meaning-Text Theory , 1998, TAG+.

[23]  Owen C. Ranbow,et al.  Formal and computational aspects of natural language syntax , 1994 .

[24]  Joachim Niehren,et al.  Querying Unranked Trees with Stepwise Tree Automata , 2004, RTA.

[25]  Vladimir Pericliev,et al.  Testing the Projectivity Hypothesis , 1986, COLING.

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

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

[28]  Manuel Bodirsky,et al.  Well-Nested Drawings as Models of Syntactic Structure ? , 2005 .

[29]  Giorgio Satta,et al.  Recognition of Linear Context-Free Rewriting Systems , 1992, ACL.

[30]  Bruno Courcelle,et al.  Basic Notions of Universal Algebra for Language Theory and Graph Grammars , 1996, Theor. Comput. Sci..

[31]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[32]  Jane J. Robinson.  Dependency Structures and Transformational Rules , 1970 .

[33]  Fernando Pereira,et al.  Non-Projective Dependency Parsing using Spanning Tree Algorithms , 2005, HLT.

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

[35]  Jan Hajic,et al.  The Prague Dependency Treebank , 2003 .

[36]  Alexander Dikovsky,et al.  DEPENDENCIES ON THE OTHER SIDE OF THE CURTAIN , 2000 .

[37]  Richard Hudson,et al.  Language Networks: The New Word Grammar , 2007 .

[38]  Joost Engelfriet,et al.  Bottom-up and top-down tree transformations— a comparison , 1975, Mathematical systems theory.

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

[40]  Pierre Boullier.  On TAG parsing , 2000 .

[41]  Solomon Marcus,et al.  Algebraic Linguistics Analytical Models , 1967 .

[42]  David A. McAllester.  On the complexity analysis of static analyses , 2002, JACM.

[43]  Sylvain Kahane,et al.  Word Order in German: A Formal Dependency Grammar Using a Topological Hierarchy , 2001, ACL.

[44]  Klaus Denecke,et al.  Universal Algebra and Applications in Theoretical Computer Science , 2018 .

[45]  Ralph Debusmann,et al.  Topological Dependency Trees: A Constraint-Based Account of Linear Precedence , 2001, ACL.

[46]  Jirí Havelka.  Relationship between Non-Projective Edges, Their Level Types, and Well-Nestedness , 2007, HLT-NAACL.

[47]  Aravind K. Joshi,et al.  Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? , 1985 .

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

[49]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[50]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[51]  Akio Fujiyoshi,et al.  Spinal-Formed Context-Free Tree Grammars , 2000, Theory of Computing Systems.

[52]  William F. Ogden,et al.  A helpful result for proving inherent ambiguity , 1968, Mathematical systems theory.

[53]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[54]  Eva Hajicová,et al.  Issues of Projectivity in the Prague Dependency Treebank , 2004, Prague Bull. Math. Linguistics.

[55]  Uwe Mönnich.  Adjunction As Substitution: An Algebraic Formulation of Regular Context-Free and Tree Adjoining Languages , 1997, ArXiv.

[56]  Jozef Gruska.  Generalized context-free grammars , 1973, Acta Cybern..

[57]  Lillian Lee,et al.  Fast context-free grammar parsing requires fast boolean matrix multiplication , 2001, JACM.

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

[59]  Aravind K. Joshi,et al.  Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.

[60]  Andrew Y. Ng,et al.  Robust Textual Inference via Graph Matching , 2005, HLT.

[61]  Marco Kuhlmann,et al.  Mildly Context-Sensitive Dependency Languages , 2007, ACL.

[62]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[63]  D. G. Hays.  Dependency Theory: A Formalism and Some Observations , 1964 .

[64]  Daniel Dominic Sleator,et al.  Parsing English with a Link Grammar , 1995, IWPT.

[65]  Sheila A. Greibach,et al.  A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[66]  Joakim Nivre.  Constraints on Non-Projective Dependency Parsing , 2006, EACL.

[67]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[68]  Joakim Nivre,et al.  Inductive Dependency Parsing (Text, Speech and Language Technology) , 2006 .

[69]  Aravind K. Joshi,et al.  Multi-Component Tree Adjoining Grammars, Dependency Graph Models, and Linguistic Analyses , 2007, ACL 2007.

[70]  Joost Engelfriet,et al.  Output String Languages of Compositions of Deterministic Macro Tree Transducers , 2002, J. Comput. Syst. Sci..

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

[72]  Giorgio Satta,et al.  A Two-Dimensional Hierarchy for Parallel Rewriting Systems , 1994 .

[73]  Aron Culotta,et al.  Dependency Tree Kernels for Relation Extraction , 2004, ACL.

[74]  Igor Mel’čuk,et al.  Dependency Syntax: Theory and Practice , 1987 .

[75]  Joachim Niehren,et al.  Logics and Automata for Totally Ordered Trees , 2008, RTA.

[76]  Joachim Niehren,et al.  Feature Automata and Recognizable Sets of Feature Trees , 1993, TAPSOFT.

[77]  Jean-Claude Raoult.  Rational tree relations , 1997 .

[78]  Sebastian Riedel,et al.  The CoNLL 2007 Shared Task on Dependency Parsing , 2007, EMNLP.

[79]  Alexander Koller,et al.  Generation as Dependency Parsing , 2002, ACL.

[80]  Carl Jesse Pollard,et al.  Generalized phrase structure grammars, head grammars, and natural language , 1984 .

[81]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[82]  Peter Neuhaus,et al.  The Complexity of Recognition of Linguistically Adequate Dependency Grammars , 1997, ACL.

[83]  Jonathan Goldstine,et al.  A simplified proof of Parikh's theorem , 1977, Discret. Math..

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

[85]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[86]  Günter Hotz,et al.  On Parsing Coupled-Context-Free Languages , 1996, Theor. Comput. Sci..

[87]  Verónica Dahl,et al.  Discontinuous grammars 1 , 2 , 1989, Comput. Intell..

[88]  Lucien Tesnière.  Éléments de syntaxe structurale , 1959 .

[89]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[90]  David J. Weir,et al.  Parsing Mildly Non-Projective Dependency Structures , 2009, EACL.

[91]  Petr Sgall,et al.  The Meaning Of The Sentence In Its Semantic And Pragmatic Aspects , 1986 .

[92]  Chris Quirk,et al.  Dependency Treelet Translation: Syntactically Informed Phrasal SMT , 2005, ACL.

[93]  David J. Weir,et al.  Characterizing mildly context-sensitive grammar formalisms , 1988 .

[94]  Ulrich Engel,et al.  Grundzüge der strukturalen Syntax , 1980 .

[95]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[96]  Aravind K. Joshi,et al.  Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars , 1988, COLING.

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

[98]  Tadao Kasami,et al.  On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[99]  Daniel J. Rosenkrantz,et al.  Matrix Equations and Normal Forms for Context-Free Grammars , 1967, JACM.