Gerdemann, Dale & van Noord, Gertjan (2000). Approximation and Exactness in Finite State Optimality Theory. Proceedings of the ACL Special Interest Group in Computational Phonology, 5, 1-12. Retrieved from https://doi.org/doi:10.7282/T3348N26
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).
Data Life Cycle Event(s) Type: Citation Date: 2000 Name: Proceedings of the ACL Special Interest Group in Computational Phonology Reference: http://arxiv.org/abs/cs/0006038v1
Additional Detail(s)
Type: Journal
Name: Proceedings of the ACL Special Interest Group in Computational Phonology
Detail: 1-12
CollectionRutgers Optimality Archive
Organization NameRutgers, The State University of New Jersey
RightsCopyright for scholarly resources published in RUcore is retained by the copyright holder. By virtue of its appearance in this open access medium, you are free to use this resource, with proper attribution, in educational and other non-commercial settings. Other uses, such as reproduction or republication, may require the permission of the copyright holder.