Results 211 to 220 of about 177,948 (265)
Some of the next articles are maybe not open access.
Syntax, 2001
Work in syntactic theory almost universally assumes that hierarchy in syntactic structure is characterized in terms of an abstract primitive relation of dominance. In this paper, we suggest that hierarchy should instead be determined via a primitive c‐command relation. This perspective turns out to restrict the range of possible syntactic structures in
Robert Frank, K. Vijay‐Shanker
openaire +1 more source
Work in syntactic theory almost universally assumes that hierarchy in syntactic structure is characterized in terms of an abstract primitive relation of dominance. In this paper, we suggest that hierarchy should instead be determined via a primitive c‐command relation. This perspective turns out to restrict the range of possible syntactic structures in
Robert Frank, K. Vijay‐Shanker
openaire +1 more source
Phonology, 1990
Kaisse (1985) presents a theory of syntax–phonology interaction whereby a rule may require one element in the environment of the rule to ccommand another element in the environment. A crucial notion in that theory, hereafter referred to as the c-command theory, is domain ccommand, which is defined as follows (Kaisse 1985: 159):In the structure [xmax ...
openaire +1 more source
Kaisse (1985) presents a theory of syntax–phonology interaction whereby a rule may require one element in the environment of the rule to ccommand another element in the environment. A crucial notion in that theory, hereafter referred to as the c-command theory, is domain ccommand, which is defined as follows (Kaisse 1985: 159):In the structure [xmax ...
openaire +1 more source
2011
AbstractThis chapter examines the concept of c-command. It shows an important grammatical consequence of the present architecture, and in particular the fact that it is based on a theorem, the Linear Correspondence Theorem. The assumption throughout the chapter has been that this condition is emergent, and therefore whatever consequences it may have ...
openaire +1 more source
AbstractThis chapter examines the concept of c-command. It shows an important grammatical consequence of the present architecture, and in particular the fact that it is based on a theorem, the Linear Correspondence Theorem. The assumption throughout the chapter has been that this condition is emergent, and therefore whatever consequences it may have ...
openaire +1 more source
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar
Grammars, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Frank 0001 +2 more
openaire +2 more sources
Conflicting C‐command requirements
Studia Linguistica, 1999The paper concentrates on the locality problem that arises in the context of raising verbs when the embedded subject moves over the experiencer. I review the major approaches put forth in the minimalist program, showing how each of them is inadequate. I propose a solution that crucially relies on the timing of operations.
openaire +1 more source
Antisymmetry and the leftness condition: Leftness as anti‐c‐command
Studia Linguistica, 2001This paper proposes a restatement of the Leftness Condition on quantifier binding in configurational terms in the framework of Kayne's (1994) Antisymmetry Theory. The Leftness Condition is reduced to an anti‐c‐command condition whereby a syntactic constituent that depends on a variable for its denotation cannot asymmetrically c‐command that variable ...
openaire +1 more source
C-Command Dependencies as TSL String Constraints
2019We provide a general framework for analyzing c-command based dependencies in syntax, e.g. binding and NPI licensing, from a subregular perspective. C-command relations are represented as strings computed from Minimalist derivation trees, and syntactic dependencies are shown to be input-output tier-based strictly local over such strings.
Graf, Thomas, Shafiei, Nazila
openaire +2 more sources
Parsing Efficiency, Binding, C-Command and Learnability
1987A principal goal of modern linguistic theory has been to formulate constraints on grammars so as to explain how it is that linguistic knowledge can be acquired. The aim has been to narrow the class of possible grammars so that it is as small as possible, consistent with observed variation in natural grammars.
Robert C. Berwick, Kenneth Wexler
openaire +1 more source
Quantificational Binding Does Not Require C-Command
Linguistic Inquiry, 2012Some version of the following claim is almost universally assumed: a quantifier must c-command any pronoun that it binds. Yet as I show, the evidence motivating this claim is not particularly strong. In addition, I gather here a wide variety of systematic counterexamples, some well-known, others new.
openaire +1 more source
Coordination, C-Command, and ‘Logophoric’ N -words
2000Abstract There are two ways in which licensing of Negative-polarity items (NPIs) shows unexpected behaviour in conjuncts and adjuncts. First, when the principles of grammar predict licensing, this licensing fails, for example in coordination.
openaire +1 more source