基于语段加标推导和特征核查的TCG分析及接口区分条件

Phase Labeling Derivational and Feature Checking Approaches to Minimalist TCG and Interface Distinctness Condition

特征核查和一致性是最简方案的重点问题。在语段理论的一致性核查运算、探测算法和循环拼读下,结合语类加标算法在阐述形式化树合并语法分析方法(TCG)及其循环结构基础上,根据结构格是特征一致性的反映原则和PIC制约,提出并分析了多重一致运算机制和κ&φ特征的相互依存赋值的解决办法,解释了未完全局部性赋值和长距离一致性。整合循环局部域理论、可见性条件,多角度证实了基于语段和标签特征的句法-音系接口条件即拼读线性化的区分条件和功能强语段vCP,旨在统一性原则下统一确立基于语段加标的语类特征一致(核查/赋值)和核心功能语类的探针序列及加标推导程序在句法演算和界定接口条件中的重要作用。

Feature checking and agreement have been the focus of minimalist program(MP). Based on the phase theory(PT), particularly probe-goal agreement/Agree(p,g) operation, probing algorithm and multiple spell-out(MSO) mechanism, this paper systematically illustrates a minimalist Tree Contraction Grammar(TCG) to MP, cyclic structure and workspace arising from it. And in accordance with the guiding principle that case is the reflex of agreement and PIC constraint, it tentatively puts forth the multiple Agree(MA) operation and k & Φ feature dependency for feature assignment as solutions to interpret the incomplete local assignment and discontinuous(long distance) dependency. It further testifies the distinctness interface condition and v CP strong phase in terms of spellout linearization. And the paper aims to uniformly establish the crucial role that phase labeling-based categorial features Agree(checking/valuation) and core functional categories(CFCs) sequence of C-T-v C-v and labeling derivational procedure with universality play in syntactic operations.