Learning OT constraint rankings using a maximum entropy model

Learning OT constraint rankings using a maximum entropy model
复制标题

使用最大熵模型学习 OT 约束排名

DOI:
--
复制
发表时间:
2003
期刊:
影响因子:
--
通讯作者:
Mark Johnson
Mark Johnson
中科院分区:
--
文献类型:
--
作者:
S. Goldwater;Mark Johnson

文献摘要

被引文献

相似文献

标准最佳理论的弱点是它无法说明具有自由变化的语法。我们在这里描述了最大熵模型,这是一个一般统计模型,并显示如何在基于约束的语言框架中应用它,以模拟和学习具有自由变化的语法以及分类语法。我们报告使用Maxent模型学习两种不同语法的结果:一种具有变化,一个没有。我们的结果与以前的概率版本的OT,逐渐学习算法的结果一样好(Boersma,1997),我们认为我们的模型更一般,并且在数学上是良好的。
A weakness of standard Optimality Theory is its inability to account for grammars with free variation. We describe here the Maximum Entropy model, a general statistical model, and show how it can be applied in a constraint-based linguistic framework to model and learn grammars with free variation, as well as categorical grammars. We report the results of using the MaxEnt model for learning two different grammars: one with variation, and one without. Our results are as good as those of a previous probabilistic version of OT, the Gradual Learning Algorithm (Boersma, 1997), and we argue that our model is more general and mathematically well-motivated.