Tesar & Smolensky (1998)

Bruce Tesar & Paul Smolensky (1998): “Learnability in Optimality Theory.” Linguistic Inquiry 29: 229–268.

The first version of the constraint-demotion algorithm appeared in:

Bruce Tesar & Paul Smolensky (1993): “The learnability of Optimality Theory: an algorithm and some basic complexity results.” Manuscript Department of Computer Science & Institute of Cognitive Science, University of Colorado at Boulder. Available as Rutgers Optimality Archive 2, `https://roa.rutgers.edu`.

The Error-Driven Constraint Demotion algorithm (EDCD) can be found in:

Bruce Tesar & Paul Smolensky (1996): “Learnability in Optimality Theory (long version).” Technical Report 96-3, Department of Cognitive Science, Johns Hopkins University, Baltimore. Available as Rutgers Optimality Archive 156, `https://roa.rutgers.edu`.

A corrected version of EDCD appeared in Boersma (2009b).

### Links to this page

- OT learning 1. Kinds of grammars
- OT learning 4. Learning an ordinal grammar
- OT learning 6. Shortcut to grammar learning
- OT learning 7. Learning from overt forms
- Robust Interpretive Parsing