Abstract
This paper explores the relative merits of constraint rankingvs. weighting in the context of a major outstanding learnability problem in phonology: learning in the face of hidden structure. Specifically, the paper examines a well-known approach to the structural ambiguity problem, Robust Interpretive Parsing (RIP; Tesar & Smolensky 1998), focusing on its stochastic extension first described by Boersma (2003). Two related problems with the stochastic formulation of RIP are revealed, rooted in a failure to take full advantage of probabilistic information available in the learner's grammar. To address these problems, two novel parsing strategies are introduced and applied to learning algorithms for both probabilistic ranking and weighting. The novel parsing strategies yield significant improvements in performance, asymmetrically improving performance of OT learners. Once RIP is replaced with the proposed modifications, the apparent advantage of HG over OT learners reported in previous work disappears (Boersma & Pater 2008).
Publisher
Cambridge University Press (CUP)
Subject
Linguistics and Language,Language and Linguistics
Reference86 articles.
1. Gradience, phonotactics, and the lexicon in English phonology;Hammond;International Journal of English Studies,2004
2. The Complexity of Ranking Hypotheses in Optimality Theory
3. Fischer Marcus (2005). A Robbins-Monro type learning algorithm for an entropy maximizing version of Stochastic Optimality Theory. MA thesis, Humboldt University, Berlin.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献