19.05.2014 Views

Reading Working Papers in Linguistics 4 (2000) - The University of ...

Reading Working Papers in Linguistics 4 (2000) - The University of ...

Reading Working Papers in Linguistics 4 (2000) - The University of ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

OPACITY AND SYMPATHY THEORY<br />

Successful candidates must match/resemble the ❀candidate as to hav<strong>in</strong>g<br />

violated at least the same faithfulness constra<strong>in</strong>ts as the ❀candidate (they<br />

must have accumulated at least the same unfaithful violations as the<br />

❀candidate).<br />

“❀SYM 16<br />

Given a sympathetic candidate ❀-Cand, to evaluate a candidate E-Cand,<br />

derived from the same <strong>in</strong>put:<br />

• If U❀-Cand ⊆ U E-Cand then E-Cand’s performance on ❀SYM is<br />

proportional to the card<strong>in</strong>ality <strong>of</strong> the set U E-Cand - U❀-Cand.<br />

• If U❀-Cand and U E-Cand are non-comparable <strong>in</strong> their unfaithful mapp<strong>in</strong>gs,<br />

then E-Cand’s performance on ❀SYM is worse than that <strong>of</strong> any<br />

candidate that is comparable.”<br />

[McCarthy 1999: 23]<br />

E-candidate is then cumulative with respect to the SYM candidate<br />

when the SYM candidate has a subset <strong>of</strong> E-candidate’s I-O Faithfulness<br />

violations.<br />

Below is an application <strong>of</strong> cumulativity to CG. <strong>The</strong> optimal<br />

candidate omorca resembles the ❀candidate <strong>in</strong> the follow<strong>in</strong>g way: they<br />

both have the feature palatal <strong>in</strong> place <strong>of</strong> the archi-phoneme I <strong>in</strong> the <strong>in</strong>put,<br />

which is precisely what OT would get wrong, giv<strong>in</strong>g *omorka as the<br />

w<strong>in</strong>ner.<br />

What happens when the sympathetic candidate does not violate any<br />

faithfulness constra<strong>in</strong>ts?<br />

16<br />

U Cand stands for the set <strong>of</strong> unfaithful mapp<strong>in</strong>gs relat<strong>in</strong>g some <strong>in</strong>put to the output<br />

candidate Cand .<br />

43

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!