Approximation and Exactness in Finite State Optimality Theory

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Previous 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).
10 pages, 1 figure, Finite-State Phonology : SIGPHON 2000, Fifth Meeting of the ACL Special Interest Group in Computational Phonology, COLING 2000

Keywords

Computation and Language, I.2.7

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30305

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0006038
 http://arxiv.org/abs/cs/0006038

Collections

arXiv