A simple proof that optimally theory is computationally intractable

Linguistic Inquiry

Volumn 37, Issue 2, 2006, Pages 271-275

  Idsardi, William J ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Computational complexity; NP hard; Optimality Theory

Indexed keywords

EID: 33646573707     PISSN: 00243892     EISSN: 00243892     Source Type: Journal    
DOI: 10.1162/ling.2006.37.2.271     Document Type: Article

References (11)

1. Barton, G. Edward, Jr., Robert C. Berwick, and Eric S. Ristad. 1987. Computational complexity and natural language, Cambridge, Mass.: MIT Press.
2. Cameron, Peter J. 1994. Combinatorics: Topics, techniques, algorithms, Cambridge: Cambridge University Press.
3. Eisner, Jason. 1997. Efficient generation in Primitive Optimality Theory. In Proceedings of the 35th annual meeting of the Association for Computational Linguistics, 313-320.
4. Eisner, Jason. 2000. Easy and hard constraint ranking in Optimality Theory: Algorithms and complexity. In Finite-state phonology: Proceedings of the 5th Workshop of the ACL Special Interest Group in Computational Phonology (SIGPHON), ed. by Jason Eisner. Lauri Karttunen, and Alain Thériault, 22-33.
5. Ellison, Mark T. 1994. Phonological derivation in Optimality Theory. In Proceedings of the 15th International Conference on Computational Linguistics (COLING). 1007-1013.
6. Garey, Michael R., and David S. Johnson. 1979. Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman.
7. Greenberg, Joseph H. 1950. The patterning of root morphemes in Semitic. Word 6:162-181.
8. Ito, Junko, and Armin Mester. 2003. Japanese morphophonemics: Markedness and word structure. Cambridge, Mass.: MIT Press.
9. Kager, René, 1999, Optimality Theory. Cambridge: Cambridge University Press,
10. McCarthy, John J. 2003. OT constraints are categorical. Phonology 20:75-138.
11. Prince, Alan, and Paul Smolensky, 2004, Optimality Theory: Constraint interaction in generative grammar, Maiden, Mass.: Blackwell.