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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

P. COUTSOUGERA<br />

operation McCarthy precisely avoids time implications: an operation<br />

implies time whereas a relation does not.<br />

8. Cumulativity<br />

8.1 Rejection <strong>of</strong> <strong>in</strong>ter-candidate correspondence by McCarthy (1999)<br />

Nevertheless, the model <strong>of</strong> ST proposed by McCarthy (1998) is too<br />

powerful. <strong>The</strong> ❀constra<strong>in</strong>t is given all the power it needs to exert ANY<br />

possible <strong>in</strong>fluence onto the candidates and thus, <strong>in</strong> a certa<strong>in</strong> sense,<br />

‘manipulate’ the result. McCarthy (1999) admits that the framework <strong>of</strong><br />

<strong>in</strong>ter-candidate correspondence is too rich as it br<strong>in</strong>gs with it the full<br />

expressive power <strong>of</strong> correspondence theory and thus permits unattested<br />

patterns <strong>of</strong> opacity to be described, such as the feed<strong>in</strong>g Duke-<strong>of</strong>-York 13<br />

ones 14 .<br />

“<strong>The</strong> theory’s excessive richness comes from <strong>in</strong>ter-candidate<br />

faithfulness constra<strong>in</strong>ts such as ❀IDENT (high) 15 . <strong>The</strong>se constra<strong>in</strong>ts allow<br />

ANY <strong>in</strong>formation about the sympathetic candidate to be transmitted to<br />

the actual output form. … I therefore reject the notion <strong>of</strong> <strong>in</strong>ter-candidate<br />

faithfulness constra<strong>in</strong>ts and here propose a more restrictive alternative.”<br />

[McCarthy 1999:20].<br />

<strong>The</strong> ❀constra<strong>in</strong>t IDENT-O (pal) <strong>in</strong> tableau 3 is what transmits the<br />

critical property <strong>of</strong> palatality to the output. This is also precisely what the<br />

constra<strong>in</strong>t ❀IDENT I-O (pal) failed to transmit to the output as it is<br />

crucially ranked below *rca. Rank<strong>in</strong>g IDENT-O (pal) above *rca would<br />

fail, too, as this would give the wrong output *(erca for the transparent<br />

example (erka (see data <strong>in</strong> 2 and derivations <strong>in</strong> 4 above).<br />

8.2 Introduc<strong>in</strong>g Cumulativity<br />

In an attempt to restrict the excessive descriptive power <strong>of</strong> the theory,<br />

McCarthy (1999) re-visits ST, rejects <strong>in</strong>ter-candidate correspondence and<br />

proposes Cumulativity (also discussed <strong>in</strong> McCarthy 1998).<br />

He <strong>in</strong>troduces an extra constra<strong>in</strong>t, ❀SYM, <strong>in</strong> the ST tableau (see<br />

below). In simple words, Cumulativity is based on evaluat<strong>in</strong>g whether<br />

two candidates share a subset <strong>of</strong> the same unfaithful mapp<strong>in</strong>gs.<br />

13 Duke-<strong>of</strong>-York derivations have the form A! B ! A.<br />

14 Accord<strong>in</strong>g to McCarthy (1999), feed<strong>in</strong>g Duke-<strong>of</strong>-York derivations are not attested<br />

<strong>in</strong> any language.<br />

15 ❀IDENT -O (pal) / (vel) <strong>in</strong> our examples <strong>of</strong> CG<br />

42

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

Saved successfully!

Ooh no, something went wrong!