Easy and Hard Constraint Ranking in Optimality Theory: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:0502:05, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,232 bytes +2,232‎ Created page with "Title: Easy and Hard Constraint Ranking in Optimality Theory Abstract: This research investigates the problem of ranking a set of constraints in Optimality Theory (OT) in a manner consistent with data. The study presents two main findings: (1) a linear-time algorithm for ranking constraints, and (2) a generalization of the algorithm that ranks all possible competitors. The paper also discusses the complexity of these ranking problems and the generation of OT grammars. F..."
Retrieved from "https://simplesci.org/wiki/Easy_and_Hard_Constraint_Ranking_in_Optimality_Theory"