Approximation and Exactness in Finite State Optimality Theory

Simple item page
dc.creatorGerdemann, Dale
dc.creatorvan Noord, Gertjan
dc.date2000-06-28
dc.date.accessioned2026-07-07T03:16:18Z
dc.date.available2026-07-07T03:16:18Z
dc.descriptionPrevious work (Frank and Satta 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gradient constraints is presented which improves upon the approximation of Karttunen (1998). The method turns out to be exact, and very compact, for the syllabification analysis of Prince and Smolensky (1993).
dc.description10 pages, 1 figure, Finite-State Phonology : SIGPHON 2000, Fifth Meeting of the ACL Special Interest Group in Computational Phonology, COLING 2000
dc.identifierhttps://arxiv.org/abs/cs/0006038
dc.identifierhttp://arxiv.org/abs/cs/0006038
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30305
dc.subjectComputation and Language
dc.subjectI.2.7
dc.titleApproximation and Exactness in Finite State Optimality Theory
dc.typetext

Files

Collections

arXiv