Parsing ellipsis efficiently

I show how a transformational account of ellipsis allows for a sound and complete parsing algorithm which allows for the efficient processing of discourses containing elliptical sentences. The result relies not just on formal properties of the grammar formalism (formal universals), but also crucially on linguistic assumptions (substantive universals).

[1]  Jens Michaelis,et al.  On Formal Properties of Minimalist Grammars , 2001 .

[2]  Gregory M. Kobele,et al.  An Automata-Theoretic Approach to Minimalism , 2007 .

[3]  Gregory M. Kobele,et al.  Eliding the derivation: A minimalist formalization of ellipsis , 2012, Proceedings of the International Conference on Head-Driven Phrase Structure Grammar.

[4]  Thomas Graf,et al.  Closure Properties of Minimalist Derivation Tree Languages , 2011, LACL.

[5]  Geoffrey K. Pullum,et al.  Exophoric VP Ellipsis , 2014 .

[6]  A. Lobeck.  Ellipsis: Functional Heads, Licensing, and Identification , 1995 .

[7]  Edward P. Stabler,et al.  Derivational Minimalism , 1996, LACL.

[8]  Jens Michaelis,et al.  Derivational Minimalism Is Mildly Context-Sensitive , 1998, LACL.

[9]  Jorge Hankamer,et al.  Deep and surface anaphora , 1993 .

[10]  Gregory M. Kobele,et al.  Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages , 2011, LACL.

[11]  Greg Kobele,et al.  Ellipsis: computation of. , 2012, Wiley interdisciplinary reviews. Cognitive science.

[12]  Stephan Oepen,et al.  39th Annual Meeting and 10th Conference of the European Chapter , 2001 .

[13]  Noam Chomsky,et al.  Minimalist inquiries : the framework , 1998 .

[14]  Edward P. Stabler,et al.  Strict Deterministic Aspects of Minimalist Grammars , 2005, LACL.

[15]  Makoto Kanazawa,et al.  Parsing and Generation as Datalog Queries , 2007, ACL.

[16]  Sylvain Pogodalla,et al.  On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms , 2004, J. Log. Lang. Inf..

[17]  J. Zwart.  The Minimalist Program , 1998, Journal of Linguistics.

[18]  Edward P. Stabler,et al.  Structural similarity within and among languages , 2003, Theor. Comput. Sci..

[19]  Sylvain Salvati,et al.  Minimalist Grammars in the Light of Logic , 2011, Logic and Grammar.

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

[21]  Gregory M. Kobele,et al.  Two Type 0-Variants of Minimalist Grammars , 2009 .

[22]  P. Lincoln.  Deciding provability of linear logic formulas , 1995 .

[23]  Edward P. Stabler,et al.  Parsing minimalist languages , 2001 .

[24]  Kyle Johnson,et al.  A step-by-step guide to ellipsis resolution , 2001 .

[25]  B David,et al.  Does She or Doesn't She? , 2012 .

[26]  R. Lees.  The grammar of English nominalizations , 1960 .

[27]  Philippe de Groote,et al.  Towards Abstract Categorial Grammars , 2001, ACL.

[28]  Gregory M. Kobele,et al.  LF-copying without LF , 2015 .

[29]  Daniel Hardt,et al.  Verb phrase ellipsis: form, meaning, and processing , 1993 .

[30]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[31]  Katalin Bimbó,et al.  The decidability of the intensional fragment of classical linear logic , 2015, Theor. Comput. Sci..