MFV3D Book Archive > Theory > Download A Theory of Syntax: Minimal Operations and Universal Grammar by Norbert Hornstein PDF

Download A Theory of Syntax: Minimal Operations and Universal Grammar by Norbert Hornstein PDF

By Norbert Hornstein

Human language turns out to have arisen approximately in the final 50-100,000 years. In evolutionary phrases, this is often the mere blink of a watch. If this can be right, then a lot of what we think about particular to language needs to in truth contain operations to be had in pre-linguistic cognitive domain names. during this booklet Norbert Hornstein, the most influential linguists engaged on syntax, discusses a topical set of matters in syntactic conception, together with a few unique proposals on the innovative of study during this quarter. He presents a conception of the elemental grammatical operations and means that there's just one that's particular to language. If this conception is true then this narrows the evolutionary hole among verbal and non-verbal primates, hence facilitating the swift evolutionary emergence of our linguistic ability.

Show description

Read or Download A Theory of Syntax: Minimal Operations and Universal Grammar PDF

Similar theory books

Scattering Theory in Mathematical Physics: Proceedings of the NATO Advanced Study Institute held at Denver, Colo., U.S.A., June 11–29, 1973

Those complaints comprise lectures given on the N. A. T. O. complicated learn Institute entitled "Scattering conception in arithmetic and Physics" held in Denver, Colorado, June 11-29, 1973. we've assembled the most sequence of lectures and a few awarded by way of different individuals that appeared certainly to enrich them.

Theory and Applications for Advanced Text Mining

This booklet consists of nine chapters introducing complex textual content mining options. they're quite a few recommendations from relation extraction to less than or much less resourced language. i think that this ebook will supply new wisdom within the textual content mining box and aid many readers open their new learn fields.

Extra resources for A Theory of Syntax: Minimal Operations and Universal Grammar

Example text

T . ][adjunct . . t . ]]]] As the relevant adjuncts are typically thought to adjoin to vP or some other projection in the vicinity of vP, and as PGs involve some CP position as the ultimate landing site, we should expect the surface form of such constructions to end up in configurations in which the A -expression c-commands all the positions through which it has moved. In short, if PGs are formed by overt sidewards A -movement, then we expect the resulting structure to have the A -element c-command its various previous launch sites.

There are also various ways around this problem such as assuming that the correct input to (16) is a phrase marker where either likes or her or both have vacated the VP. 29 (20) [TP John [T’ [vP [v’ likes+v [VP her]]]]] As is evident, this version of the LCA invokes c-command. However, it is by no means the only possible approach to linearization. Nor is it clear that c-command is crucial to the success of the algorithm. Here’s what I mean. A linearized order is asymmetric in the sense that if a precedes b then b does not precede a.

DP . ] [V DP]] Thus, here PRO/reflexive is not c-commanded by its antecedent, nor, apparently, need it be. If these cases are indeed cases of OC/binding, then it appears that there exist some licit cases of binding without c-command, which are derivable by a series of licit movement operations. 23 C-command is expected to obtain in standard cases of binding within single sub-trees (assuming that they are formed by overt movement), because the Extension enforces c-command in such cases. We also expect ccommand to appear in those cases of SWM where the movement is to the left out of an adjunct adjoined below TP.

Download PDF sample

Rated 4.11 of 5 – based on 21 votes