数问最简句法中的“加标算法”——从技术层面及延伸的理论层面说起  

Remarks on the labeling algorithm in minimalist syntax:Some technical and extended theoretical issues

作　　者：邓昊熙[1] DENG Haoxi(College of Foreign Languages,Wuzhou University,Wuzhou 543002,P.R.China)

机构地区：[1]梧州学院

出　　处：《外国语言文学》2023年第4期25-36,48,133,共14页Foreign Language and Literature Studies

基　　金：教育部人文社会科学研究青年基金项目“生成语法语段理论下句法合并和语义接口的互动性研究——现代汉语形义错配现象新解”(17YJC740014)。

摘　　要：“加标算法”是最简句法合并操作进一步简化后给所生成的句法构件添加标签的重要机制。文章先归纳该算法的要点,结合例子分析其实施过程并做出简要评述。其次,着重从“最小搜索如何实施?”“共享特征能否充当标签?”“移走成分是否就能加标?”“语迹/拷贝是否不可见?”“是否还有处理对称性句法构件加标的其它方法?”“何种成分能充当标签?”等方面入手,深入剖析该算法在技术层面及延伸的理论层面所存在的主要问题。研究表明,该算法具有重要的理论价值,但在强势最简命题要求下该算法如何为句法构件加标仍然需要进一步探讨。Along with the further simplification of merge operation,labeling algorithm plays an important role in labeling the syntactic objects generated.Based on the introduction to the essentials,the implementation of and brief comments on labeling algorithm,this paper analyzes some of its technical and extended theoretical issues,including “how to implement minimal search?”,“shared feature acts as label?”,“labeling by moving?”,“trace/copy inaccessible?”,“other ways to label symmetric syntactic objects?”,and “what can act as label?” It is argued that despite its theoretical significance,labeling algorithm still needs further exploration regarding how to label syntactic objects generated by the simplest merge under the requirement of the strongest minimalist thesis.

关 键 词：加标算法 合并 句法构件 标签 

分 类 号：H0[语言文字—语言学]