The computational nature of phonological generalizations
The computational nature of phonological generalizations
复制标题
语音概括的计算性质
DOI：
10.1515/9783110451931-005
复制
发表时间：
2018
影响因子：
0.5
通讯作者：
Jeffrey Heinz
中科院分区：
文献类型：
--
作者：
Jeffrey Heinz
本章从计算的角度研究语音标记约束的类型学性质和从底层到表面形式转换的类型学性质。它认为存在强大的计算定律来约束这些约束和转换的形式。这些定律目前在所谓的次规则层次结构中表述得最为清楚，它已经为字符串集（用于建模约束）建立，并且目前正在为字符串到字符串映射（用于建模转换）建立。预计未来的研究将揭示同样强大的法律适用于非基于字符串的表示。最后，本章认为，这些规律是人类如何从数据中进行归纳的自然结果。
This chapter studies the nature of the typology of phonological markedness constraints and the nature of the typology of the transformation from underlying to surface forms from a computational perspective. It argues that there are strong computational laws that constrain the form of these constraints and transformations. These laws are currently stated most clearly in terms of the so-called subregular hierarchies, which have been established for stringsets (for modeling constraints) and are currently being established for string-to-string maps (for modeling the transformations). It is anticipated that future research will reveal equally powerful laws applicable to non-string-based representations. Finally, this chapter argues that these laws arise as a natural consequence of how humans generalize from data.