首页|最简方案框架下加标算法的解释力及其缺陷

最简方案框架下加标算法的解释力及其缺陷

扫码查看
最简方案将合并视为人类语言运算系统的核心操作.合并产生的句法体需要在语段层面进行语类标记才能在概念-意向系统获得恰当的语义诠释,负责加标操作的是满足最小搜索和有效运算的加标算法.本文首先对加标算法的理论背景和核心操作进行介绍,然后重点探讨加标算法的解释力.分析发现,加标算法可以对相关句法现象提供合理的解释,主要包括:(1)扩展投射原则和空语类原则的有机统一;(2)循环论元移位和非论元移位的动因;(3)宾语移位的动因.本文最后指出,加标算法在概念层面和语言事实解释层面仍然存在诸多需要解决的问题.
The Explanatory Power of Labelling Algorithm in Minimalism and Its Deficiencies
Minimalism assumes that Merge is a fundamental operation in the computational system of human language.Syntactic objects generated via iterative Merge should be labelled so as to receive proper interpretation at the conceptual-intentional interface and what is held responsible for labelling is the labelling algorithm that functions in compliance with minimal search and efficient computation.After briefly outlining the theoretical background and the core working mechanism of the labelling algorithm,this paper discusses its explanatory power in detail.Various syntactic phenomena are handled in a unified manner through recourse to the labelling algorithm,including the unification of Extended Projection Principle and Empty Category Principle,the driving force of successive cyclic A-movement and A-bar movement and the motivation of object movement.Finally,this paper points out the unresolved conceptual as well as empirical problems that the labelling algorithm encounters.

MinimalismSimplest MergeLabelling AlgorithmMinimal Searchthe Third Factor

佟和龙、缪海涛、田启林

展开 >

上海海事大学

扬州大学

浙江外国语学院

最简方案 最简合并 加标算法 最小搜索 第三要素

国家社会科学基金

20BYY010

2024

中国外语
高等教育出版社

中国外语

CSSCI北大核心
影响因子:2.344
ISSN:1672-9382
年,卷(期):2024.21(2)
  • 2