Late Adjunction and Minimalist Phrase Structure
Late Adjunction and Minimalist Phrase Structure
复制标题
后期附加语和简约的短语结构
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
A. Stepanov
中科院分区：
文献类型：
--
作者：
A. Stepanov
提出了一种基于裸短语结构框架的短语结构构建算法。该算法植根于这样一种想法，即合并的应用--组合语法对象的操作--不应该改变现有结构中的基本关系集(特别是c命令)，即Chomsky(2000)所说的“最少篡改”。在提出的算法下，这一想法转化为要求合并必须在可能的情况下发生在树/短语标记的根上。因此，该算法强制(基本生成或移动的)结构附件在后循环中合并。讨论了所提出的算法的三个经验结果：(1)涉及跨体验者提升的结构(例如，在Mary看来John是聪明的)被证明对于最小链接条件是不成问题的(参见Chomsky，1995b)；(2)对附属岛效应(Huang 1982)提出了一个新的解释；(3)对俄语中的近似性倒装现象进行了原则性分析。
An algorithm of phrase structure building is proposed within the bare phrase structure framework. The algorithm is rooted in the idea that applications of Merge–the operation that combines syntactic objects–should not change the set of basic relations (in particular, c-command) in the existing structure, what Chomsky (2000) terms “Least Tampering.” Under the proposed algorithm, this idea translates into a requirement that Merger must take place at the root of the tree/phrase marker when possible. As a result, the algorithm forces (base-generated or moved) structural adjuncts to be Merged postcyclically. Three empirical consequences of the proposed algorithm are discussed: (1) constructions involving raising across the experiencer (e.g., John seems to Mary to be smart) are shown not to be problematic for the Minimal Link Condition (cf. Chomsky 1995b); (2) a novel account of Adjunct Island effects (Huang 1982) is proposed; and (3) a principled analysis of approximative inversion in Russian is offered.