Skip to content

Empirical Tests of the Gradual Learning Algorithm

by Paul Boersma, Bruce Hayes
Linguistic Inquiry ()
Get full text at journal


The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and Smolensky (1993, 1996, 1998, 2000), which initiated the learnability research program for Optimality Theory. We argue that the Gradual Learning Algorithm has a number of special advantages: it can learn free variation, deal effectively with noisy learning data, and account for gradient well-formedness judgments. The case studies we examine involve Ilokano reduplication and metathesis, Finnish genitive plurals, and the distribution of English light and dark /l/.

Cite this document (BETA)

Readership Statistics

195 Readers on Mendeley
by Discipline
84% Linguistics
5% Psychology
4% Social Sciences
by Academic Status
37% Student > Ph. D. Student
13% Student > Master
11% Researcher
by Country
7% United States
4% Germany
3% Canada

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in