检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张连文[1] ZHANG Lian-wen
机构地区:[1]济南大学外国语学院
出 处:《天津外国语大学学报》2020年第6期51-73,156,共24页Journal of Tianjin Foreign Studies University
摘 要:特征核查和一致性是最简方案的重点问题。在语段理论的一致性核查运算、探测算法和循环拼读下,结合语类加标算法在阐述形式化树合并语法分析方法(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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7