The Complexity of Ranking Hypotheses in Optimality Theory

Jason Riggle


Anthology ID:
J09-1004
Volume:
Computational Linguistics, Volume 35, Number 1, March 2009
Month:
March
Year:
2009
Address:
Cambridge, MA
Venue:
CL
SIG:
Publisher:
MIT Press
Note:
Pages:
47–59
Language:
URL:
https://aclanthology.org/J09-1004
DOI:
10.1162/coli.07-031-R2-06-98
Bibkey:
Cite (ACL):
Jason Riggle. 2009. The Complexity of Ranking Hypotheses in Optimality Theory. Computational Linguistics, 35(1):47–59.
Cite (Informal):
The Complexity of Ranking Hypotheses in Optimality Theory (Riggle, CL 2009)
Copy Citation:
PDF:
https://preview.aclanthology.org/ingestion-script-update/J09-1004.pdf