Journal article

Empirical Tests of the Gradual Learning Algorithm

Boersma P, Hayes B ...see all

Linguistic Inquiry, vol. 32, issue 1 (2001) pp. 45-86

  • 210

    Readers

    Mendeley users who have this article in their library.
  • Citations

    Citations of this article.
Sign in to save reference

Abstract

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/.

Author-supplied keywords

  • finnish
  • ilokano
  • learnability
  • optimality theory
  • variation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • Paul Boersma

  • Bruce Hayes

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free