Abstract: | Prince (2015) shows that OT has the following surprising property: no ranking information is lost by replacing two violation tableaux with the single tableau obtained by summing any row of one of the two original tableaux with any row of the other. Which properties of OT are responsible for this result? This squib answers this question: Prince's result that 'one tableau suffices' holds whenever grammatical optimization is relative to a strict additive weak ordering. As an application, Prince's result is extended from OT to HG. |