|
840-0606
|
Misplaced Optimism |
|
Author
|
William Idsardi University of Maryland <idsardi@umd.edu> [Details]
|
Length | 3 pp. |
|
Files
|
|
|
Abstract
|
| Kornai 2006 discusses the use of self-conjoined constraints in the complexity proof of Idsardi 2006. Kornai points out that if self-conjoined constraints are restricted to small finite sets and domains then the force of the proof is blunted, and conjectures that self-conjoined constraints are limited to bounded domains and nodes in the feature geometry. This paper summarizes the use of self-conjoined constraints in Ito and Mester 2003 and other works, and shows that current OT practice does not limit conjoined constraints in the suggested ways. |
|
Keywords | OT, generation, NP-hard, complexity, dissimilation, OCP |
Area | Computation, Formal Analysis |
Type | Remark or Reply |