The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).

Zoekresultaten

Zoekopdracht: faculteit: "FGw" en publicatiejaar: "2009"

AuteurP. Boersma
TitelSome correct error-driven versions of the Constraint Demotion algorithm
TijdschriftLinguistic Inquiry
Jaargang40
Jaar2009
Nummer4
Pagina's667-686
ISSN00243892
FaculteitFaculteit der Geesteswetenschappen
Instituut/afd.FGw: Amsterdam Center for Language and Communication (ACLC)
SamenvattingThis article shows that Error-Driven Constraint Demotion (EDCD), an error-driven learning algorithm proposed by Tesar (1995) for Prince and Smolensky’s (1993/2004) version of Optimality Theory, can fail to converge to a correct totally ranked hierarchy of constraints, unlike the earlier non-error-driven learning algorithms proposed by Tesar and Smolensky (1993). The cause of the problem is found in Tesar’s use of “mark-pooling ties,” indicating that EDCD can be repaired by assuming Anttila’s (1997) “permuting ties” instead. Proofs show, and simulations confirm, that totally ranked hierarchies can indeed be found by both this repaired version of EDCD and Boersma’s (1998) Minimal Gradual Learning Algorithm.
Soort documentArtikel
Download
Document finderUvA-Linker