当前位置: X-MOL 学术Phonology › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Learning opacity in Stratal Maximum Entropy Grammar
Phonology ( IF 1.214 ) Pub Date : 2017-08-14 , DOI: 10.1017/s095267571700015x
Aleksei Nazarov , Joe Pater

Opaque phonological patterns are sometimes claimed to be difficult to learn; specific hypotheses have been advanced about the relative difficulty of particular kinds of opaque processes (Kiparsky 1971, 1973), and the kind of data that is helpful in learning an opaque pattern (Kiparsky 2000). In this paper, we present a computationally implemented learning theory for one grammatical theory of opacity, a Maximum Entropy version of Stratal OT (Bermúdez-Otero 1999, Kiparsky 2000), and test it on simplified versions of opaque French tense–lax vowel alternations and the opaque interaction of diphthong raising and flapping in Canadian English. We find that the difficulty of opacity can be influenced by evidence for stratal affiliation: the Canadian English case is easier if the learner encounters application of raising outside the flapping context, or non-application of raising between words (e.g. life with [ʌɪ]; lie for with [aɪ]).

中文翻译:

Stratal最大熵语法中的学习不透明度

有时声称不透明的语音模式很难学习;关于特定类型的不透明过程的相对难度(Kiparsky 1971, 1973)以及有助于学习不透明模式的数据类型(Kiparsky 2000),已经提出了特定的假设。在本文中,我们提出了一种计算实现的学习理论,用于一种不透明的语法理论,即 Stratal OT 的最大熵版本(Bermúdez-Otero 1999,Kiparsky 2000),并在不透明的法语时态-松散元音交替的简化版本和加拿大英语中双元音升高和拍打的不透明交互。我们发现不透明的难度可能会受到层级隶属关系的证据的影响:如果学习者遇到在扑动语境之外提出的应用,加拿大英语的情况会更容易,生活与 [ʌɪ];与 [aɪ])。
更新日期:2017-08-14
down
wechat
bug