PL EN


2008 | 44 | 2 | 215-245
Article title

MINIMISE AD (?/*IN-)FINITUM? IN DEFENSE OF WEAKLY CARTOGRAPHIC COMPUTATIONAL MODELS

Authors
Content
Title variants
Languages of publication
EN
Abstracts
EN
This paper provides a critical overview of the 'strongly derivational' and 'non-cartographic' approaches to syntax based solely on the relation between a newly selected lexical item (LI) and the so-called derivational space (the existing syntactic object) treated as the pivot of the syntactic derivation. Specifically, it is argued that, given the asymmetry requirement requisite for linearization, as stated in Kayne's (1994) Linear Correspondence Axiom (LCA) and Chomsky's (1994) Bare Phrase Structure (BPS), the abovementioned procedure is unattainable in certain strongly derivational syntactic configurations. The latter sections of the paper, while still arguing against the excessively minimized derivational space, focus on the non-cartographic 'Escape' system proposed by Zwart (2007). It is shown that the data (comprising mostly the so-called 'look-ahead' - based cases) that prove problematic for Escape can be captured within a moderately (i.e. weakly) cartographic view of the left periphery in accord with Thráinsson's (1996) Limited Diversity Hypothesis.
Contributors
  • Piotr Ceglowski, Uniwersytet im. Adama Mickiewicza, ul. Wieniawskiego 1, 61-712 POznan, Poland
References
Document Type
Publication order reference
Identifiers
CEJSH db identifier
10PLAAAA081227
YADDA identifier
bwmeta1.element.633a72a4-628c-34d4-8f9d-e4e7346d1ac1
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.