Abstract:

Generating labeled hierarchical structures, the interaction of Merge with principles of minimized computations supports SMT (Strong Minimalist Thesis) theory. Based on projection theory, this paper focuses on the minimized computations of minimalist generative procedure, binary Merge operations and labeling mechanisms with interpretive relevance, together with linear cyclicity of phrases restricted to numeration/N-PF (phonetic form) interface mapping. It further addresses parameter setting patterns (complex sets of multiple modules, representations and complex movement rules) and their relevance to acquisition (projection problem), with reference to the Merge-based functional argument structure, and establishes the minimal structural distance (MSD) as the elementary computational (procedure complexity) problem. By investigating the relevance of parametric setting to functional categories and their features, this paper clarifies the visibility of merge labels in terms of labeling algorithm (LA). This article rigorously redefines the generalized cycles, extension condition (EC) and edge condition imposed on Merge by derivational cyclicity. Results indicate that language parametric differences (variations) can be attributed to Merge composition and labeling intensity. This article therefore sheds light on the nature of merge operations, labeling distinctions and interpretive effects, and particularly, clarifies the nature of minimized computations established by the labeling algorithm, phasal cyclic linearizations (CL) and multiple transfer under the economy principle. Demonstrating that merge and labeling are constrained by minimal search (MS), while head or endocentricity detection can be reduced to minimal search of lexical item (LI) for phase labeling, i.e., minimal head detection (MHD), this paper makes important contributions to the typological investigations of parameters.

Keywords: minimized computations; merge; cyclic linearization; word order parameter; argument structure; parameter setting

摘要：

合并与最小化计算原则互动实现了强势最简论的解释目标,合并产生加标层级结构。本文在投射理论基础上澄清最简生成程序的最小化计算、二元合并运算、加标机制及其解释关联和限制到算式库语音式接口映射的语段线性循环性,以合并生成的功能论元结构论证了参数设置模式（多模块、表征层次以及复杂移位规则组成的复杂集合）及其习得关联（投射问题）,进一步明确了最小结构距离是基本的计算（程序复杂性）问题,在调查参数设定与功能语类及特征的关联性基础上明晰了加标算法下合并标签的可见性,严格界定了广义循环以及推导的循环性要求合并满足的扩展条件和边界条件,参数化归于合并运算的组合以及加标强度,旨在阐明合并运算的本质及加标区分和解释效力、加标算法和语段循环线性化及多重移交构成的经济原则下最小化计算的本质,合并与加标受最小搜索制约;中心语/向心探测可降解至语段加标中词项LI的最小搜索/最小中心语探测,并进一步推进参数的类型考量。

关键词: 最小化计算, 合并, 循环线性化, 语序参数, 论元结构, 参数设置