Implications of pseudo-gapping for binding and the representation of information structure* mark R. baltin
In addition to the standard ellipsis process known as VP-ellipsis, another ellipsis process, known as pseudo-gapping, was first brought to the fore-front in the 1970’s by Sag (1976) and N. Levin (1986). This process elides subparts of a VP, as in (1): (1) Although I don’t like steak, I do___pizza. Developing ideas of K.S. Jayaseelan (Jayaseelan (1990)), Howard Lasnik has developed an analysis in which pseudo-gapping, which, in some instances, looks as though it is simply deleting a verb, is in fact deletion of a verb phrase, so that pseudo-gapping is really a probe into the structure of the verb phrase. I will examine pseudo-gapping in detail, and will show that it truly is a gold mine of insight into a number of fundamental issues in syntax. More concretely, I will demonstrate that a careful, detailed analysis of this process will bear on the derivational level at which Principle A of the binding theory applies, as well as the amount of explicit encoding within syntactic representations of informational structure, particularly focus. The paper will also re-assess Lasnik’s conclusion that pseudo-gapping provides evidence for Larson’s (1988) V-raising to a higher empty V position, a case of head movement, and will show that the movement involved is actually a case of remnant movement, or XP-movement.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Chaos and Neural Coding: Is the Binding Problem a Pseudo-Problem?Antonino Raffone & Cees van Leeuwen - 2001 - Behavioral and Brain Sciences 24 (5):826-827.
The Seven Sins of Pseudo-Science.A. A. Derksen - 1993 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 24 (1):17 - 42.
3.4 Extensions.Author unknown - manuscript
Achieving Expressive Completeness and Computational Efficiency for Underspecified Scope Representations.Shalom Lappin - unknown
Added to index2009-01-28
Total downloads25 ( #203,945 of 2,171,803 )
Recent downloads (6 months)1 ( #326,702 of 2,171,803 )
How can I increase my downloads?