A Simple Proof That Optimality Theory Is Computationally Intractable
Adapting arguments from Eisner 1997, 2000, this remark provides a simple proof that the generation problem for Optimality Theory (Prince and Smolensky 2004) is NP-hard. The proof needs only the binary evaluation of constraints and uses only constraints generally employed in the Optimality Theory literature. In contrast, rule-based derivational systems are easily computable, belonging to the class of polynomialtime algorithms, P (Eisner 2000).
2001 ◽
Vol 23
(3)
◽
pp. 422-423
2002 ◽
2013 ◽
Vol 4
(1)
◽
pp. 111-126
2001 ◽
Vol 32
(4)
◽
pp. 257-270
◽
Keyword(s):
Keyword(s):