用着色算法实现生成语法中的theta理论，解析句法结构形成机制
Theta Theory: operads and coloring
- 基于颜色规则的运算符生成集，递归实现theta约束
- 着色过滤等价于带颜色的合并操作，揭示语义分化机制
- 适合形式语言学与计算语法研究者阅读
我们给出了一个彩色运算符生成集的显式构造，用于在生成语法最小主义理论的数学模型中实现theta理论，表现为对句法对象的着色算法。我们证明工作空间上的余积运算允许theta准则的递归实现。此外，我们还表明，通过着色规则对由合并自由生成的结构进行过滤，等价于通过带颜色的合并过程形成结构：彩色运算符生成元的形式揭示了外部合并与内部合并之间的语义二分，其中内部合并仅作用于非theta位置。
原文摘要 · Abstract (English)
We give an explicit construction of the generating set of a colored operad that implements theta theory in the mathematical model of Minimalism in generative linguistics, in the form of a coloring algorithm for syntactic objects. We show that the coproduct operation on workspaces allows for a recursive implementation of the theta criterion. We also show that this filtering by coloring rules on structures freely formed by Merge is equivalent to a process of structure formation by a colored version of Merge: the form of the generators of the colored operad then implies the dichotomy is semantics between External and Internal Merge, where Internal Merge only moves to non-theta positions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。