2007The Benefits of Errors: Learning an OT Grammar with a Structured Candidate Set.
Conference talk given at: Cognitive Aspects of Computational Language Acquisition, ACL, June 29, 2007, Prague, Czech Republic. See also http://ufal.mff.cuni.cz/acl2007/workshops/index.php/ws15/. Slides. Download article from ACL Anthology..




We compare three recent proposals adding a topology to OT: McCarthy's Persistent OT, Smolensky's ICS and Bíró's SA-OT. To test their learnability, constraint rankings are learnt from SA-OT's output. The errors in the output, being more than mere noise, follow from the topology. Thus, the learner has to reconstructs her competence having access only to the teacher's performance.