Results 1 - 10
of
83
Derivational Minimalism
, 1997
"... A basic idea of the transformational tradition is that constituents move. More recently, there has been a trend towards the view that all features are lexical features. And in recent "minimalist" grammars, structure building operations are assumed to be feature driven. A simple grammar formalism wi ..."
Abstract
-
Cited by 82 (15 self)
- Add to MetaCart
A basic idea of the transformational tradition is that constituents move. More recently, there has been a trend towards the view that all features are lexical features. And in recent "minimalist" grammars, structure building operations are assumed to be feature driven. A simple grammar formalism with these properties is presented here and briefly explored. Grammars in this formalism can define languages that are not in the "mildly context sensitive" class defined by Vijay-Shanker and Weir (1994).
Explaining Crossover and Superiority as Left-to-Right Evaluation
- LINGUISTICS AND PHILOSOPHY
, 2006
"... We present a general theory of scope and binding in which both crossover and superiority violations are ruled out by one key assumption: that natural language expressions are normally evaluated (processed) from left to right. Our theory is an extension of Shan’s (2002) account of multiple-wh questi ..."
Abstract
-
Cited by 34 (10 self)
- Add to MetaCart
We present a general theory of scope and binding in which both crossover and superiority violations are ruled out by one key assumption: that natural language expressions are normally evaluated (processed) from left to right. Our theory is an extension of Shan’s (2002) account of multiple-wh questions, combining continuations (Barker, 2002) and dynamic type-shifting. Like other continuation-based analyses, but unlike most other treatments of crossover or superiority, our analysis is directly compositional (in the sense of, e.g., Jacobson, 1999). In particular, it does not postulate a level of Logical Form or any other representation distinct from surface syntax. One advantage of using continuations is that they are the standard tool for modeling order-ofevaluation in programming languages. This provides us with a natural and independently motivated characterization of what it means to evaluate expressions from left to right. We give a combinatory categorial grammar that models the syntax and the semantics of quantifier scope and wh-question formation. It allows quantificational binding but not crossover, in-situ wh but not superiority violations. In addition, the analysis automatically accounts for a variety of sentence types involving binding in the presence of pied piping, including reconstruction cases such as Whose criticism of hisi mother did each personi resent?
Quantifier Scope and Constituency
- IN PROCEEDINGS OF THE 33RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
, 1995
"... Traditional approaches to quantifier scope typically need stipulation to exclude readings that are unavailable to human understanders. This paper ..."
Abstract
-
Cited by 27 (2 self)
- Add to MetaCart
Traditional approaches to quantifier scope typically need stipulation to exclude readings that are unavailable to human understanders. This paper
VERB PHRASE ELLIPSIS: FORM, MEANING, AND PROCESSING
, 1993
"... The central claim of this dissertation is that an elliptical VP is a proform. This claim has two primary consequences: first, the elliptical VP can have no internal syntactic structure. Second, the interpretation of VP ellipsis must be governed by the same general conditions governing other proforms ..."
Abstract
-
Cited by 23 (5 self)
- Add to MetaCart
The central claim of this dissertation is that an elliptical VP is a proform. This claim has two primary consequences: first, the elliptical VP can have no internal syntactic structure. Second, the interpretation of VP ellipsis must be governed by the same general conditions governing other proforms, such as pronouns. The basic condition governing the interpretation of a proform is that it must be semantically identified with its antecedent. A computational model is described in which this identification is mediated by store and retrieve operations defined with respect to a discourse model. Because VP ellipsis is treated on a par with other proforms, the ambiguity arising from “sloppy identity ” becomes epiphenomenal, resulting from the fact that the store and retrieve operations are freely ordered. A primary argument for the proform theory of VP ellipsis concerns syntactic constraints on variables within the antecedent. I examine many different types of variables, including reflexives, reciprocals, negative polarity items, and wh-traces. In all these cases, syntactic constraints are not respected under ellipsis. This indicates that the relation governing VP ellipsis is semantic rather than syntactic. In further support of the proform theory, I show that there is a striking similarity in the antecedence possibilities for VP ellipsis and those for pronouns. Two
Continuations and the Nature of Quantification
- NATURAL LANGUAGE SEMANTICS
, 2002
"... This paper proposes that the meanings of some natural language expressions should be thought of as functions on their own continuations. Continuations are a well-established technique in the theory of programming language semantics; in brief, a continuation is the entire default future of a computat ..."
Abstract
-
Cited by 22 (3 self)
- Add to MetaCart
This paper proposes that the meanings of some natural language expressions should be thought of as functions on their own continuations. Continuations are a well-established technique in the theory of programming language semantics; in brief, a continuation is the entire default future of a computation. I show how a continuation-based grammar can unify several aspects of natural language quantification in a new way: merely stating the truth conditions for quantificational expressions in terms of continuations automatically accounts for scope displacement and scope ambiguity. To prove this claim, I exhibit a simple finite context-free grammar with a strictly compositional semantics in which quantificational NPs are interpreted in-situ but take semantic scope over larger constituents. There is no Quantifier Raising (nor any use of a level of Logical Form distinct from overt syntax), no Cooper Storage (or other similar mechanisms used in many recent HPSG, Categorial, or Type-logical treatments), and no need for type-shifting (as in Hendriks' Flexible Types account). Continuations also provide a natural account of generalized coordination that does not require either type-shifting or type-polymorphism. Compositionality issues are discussed in some detail.
Situations and Individuals
"... This book deals with the semantics of natural language expressions that are commonly taken to refer to individuals: pronouns, definite descriptions and proper names. It claims, contrary to previous theorizing, that they all have a common syntax and semantics, roughly that which is currently associat ..."
Abstract
-
Cited by 21 (0 self)
- Add to MetaCart
This book deals with the semantics of natural language expressions that are commonly taken to refer to individuals: pronouns, definite descriptions and proper names. It claims, contrary to previous theorizing, that they all have a common syntax and semantics, roughly that which is currently associated by philosophers and linguists with definite descriptions as construed in the tradition of Frege. As well as advancing this proposal, I hope to achieve at least one other aim, that of urging semanticists dealing with pronoun interpretation, in particular donkey anaphora, to consider a wider range of theories at all times than is sometimes done at present. I am thinking particularly of the gulf that seems to have emerged between those who practice some version of dynamic semantics (including DRT) and those who eschew this approach and rely on some version of the E-type analysis for donkey anaphora (if they consider this phenomenon at all). In my opinion there is too little work directly comparing the claims of these two schools (for that is what they amount to) and testing them against the data in the way that any two rival theories might be tested. (Irene Heim’s 1990 article in Linguistics and Philosophy does this, and
QUESTIONS WITH QUANTIFIERS
, 1993
"... This paper studies the distribution of ‘list readings’ in questions like who does everyone like? vs. who likes everyone?. More generally, it focuses on the interaction between w&words and quantified NPs. It is argued that, contrary to widespread belief, the pattern of available readings of constitue ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
This paper studies the distribution of ‘list readings’ in questions like who does everyone like? vs. who likes everyone?. More generally, it focuses on the interaction between w&words and quantified NPs. It is argued that, contrary to widespread belief, the pattern of available readings of constituent questions can be explained as a consequence of Weak Crossover, a well-known property of grammar. In particular, list readings are claimed to be a special case of ‘functional readings’, rather than arising from quantifying into questions. Functional readings are argued to be encoded in the syntax as doubly indexed traces, which straightforwardly leads to a Crossover account of the absence of list readings in who likes evevone?. Empirical and theoretical consequences of this idea for the syntax and semantics of questions are considered.
Synchronous Models of Language
- IN PROCEEDINGS OF THE 34TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL
, 1996
"... In synchronous rewriting, the productions of two rewriting systems are paired and applied synchronously in the derivation of a pair of strings. We present a new synchronous rewriting system and argue that it can handle certain phenomena that are not covered by existing synchronous systems. ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
In synchronous rewriting, the productions of two rewriting systems are paired and applied synchronously in the derivation of a pair of strings. We present a new synchronous rewriting system and argue that it can handle certain phenomena that are not covered by existing synchronous systems.

