From intensional properties to universal support
From intensional properties to universal support
复制标题
从内在属性到普遍支持
DOI：
10.1353/lan.2016.0029
复制
发表时间：
2016
期刊：
影响因子：
2.1
通讯作者：
Alan Prince
中科院分区：
文献类型：
--
作者：
B. Alber;Natalie DelBusso;Alan Prince
最优理论（OT）系统通过定义其约束和它们评估的结构来指定。这就产生了一套语法，即系统的类型学，它产生于约束和结构之间往往复杂的相互作用。每一种类型都是由有限的候选集合（csets）决定的。我们如何知道我们已经组装了一个通用的支持，一个足以区分系统的所有语法的cset集合？由于缺乏普遍的支持，我们没有类型学，也就无法系统地处理它的结构和后果，这个具体的问题可以通过加强对类型学结构的抽象理解来回答。根据属性理论（阿尔伯和普林斯，2015 a，B），类型学被分解为一组属性：具有互斥值的排名条件。当每个值的结构相关性被确定时，定义语法的等级值也确定了其最优值中表现出的扩展特征。假设我们有一个类型学的属性分析，这个类型学是从对OT系统的一个建议支持中得出的。如果每一个一致的选择值，确保一个单一的最佳选择是在每一个cset承认的系统，然后没有语法来自建议的支持可以分裂考虑进一步cset，和支持必须是普遍的系统。这种证明方法适用于任何OT系统。在这里，我们使用它来分析韵律系统nGX（阿尔伯和王子2015 b），确定其普遍支持和形式的形状，使其语法最佳。
An optimality-theoretic (OT) system is specified by defining its constraints and the structures they evaluate. These give rise to a set of grammars, the typology of the system, which emerges from the often complex interactions among constraints and structures. Every typology is determined by a finite collection of candidate sets (csets). How do we know that we have assembled a universal support, a collection of csets sufficient to distinguish all grammars of the system? Lacking a universal support, we do not have the typology and we cannot deal systematically with its structure and consequences.This concrete question can be answered in terms of an enhanced abstract understanding of typological structure. Under property theory (Alber & Prince 2015a,b), a typology is resolved into a set of properties: ranking conditions that have mutually exclusive values. When the structural correlates of each value are determined, the ranking values defining a grammar also determine the extensional traits exhibited in its optima. Suppose we have the property analysis of a typology derived from a proposed support for an OT system. If every consistent choice of values ensures that a single optimum is chosen in every cset admitted by the system, then no grammar derived from the proposed support can be split by consideration of further csets, and that support must be universal for the system. This method of proof is applicable to any OT system. Here we use it to analyze the prosodic system nGX (Alber & Prince 2015b), determining its universal supports and the shape of the forms made optimal by its grammars.