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.

P. COUTSOUGERA<br />

/alevr-I-a/<br />

Tableau 4: Over-application <strong>of</strong> velarisation<br />

Strong<br />

ONSET<br />

*Cmplx ICC-<br />

Obstr<br />

(voi)<br />

❀IDENT<br />

-O (vel)<br />

✮MAX<br />

I-O C<br />

*rca<br />

❀alev.rka * ✓ *<br />

☞alef.ka * *<br />

alef.ca * *<br />

ale.ca * *<br />

ale.fa * * * *<br />

alev.ka * * *<br />

IDENT-<br />

I-O(pal)<br />

Note that the sympathetic constra<strong>in</strong>ts ❀IDENT-O (vel) / ❀IDENT-O (vel), are<br />

crucially ranked before *rca.<br />

Malikouti-Drachman proposes a syllabification 10 with nonbranch<strong>in</strong>g<br />

codas and maximal consonants (voiceless stops) <strong>in</strong> the onset<br />

position <strong>of</strong> the syllable. Branch<strong>in</strong>g onsets are permitted, too. Codas may<br />

not be maximal, so that they will not be less sonorant (or more complex)<br />

than follow<strong>in</strong>g onsets (also supported <strong>in</strong> Drachman & Malikouti-<br />

Drachman 1996). By strong onset it is meant maximal onset. F<strong>in</strong>ally,<br />

accord<strong>in</strong>g to Malikouti-Drachman (with the exception <strong>of</strong> ICC Obstr<br />

(voi)= voic<strong>in</strong>g agreement <strong>in</strong> obstruent clusters), the constra<strong>in</strong>t hierarchy<br />

<strong>in</strong> CG is the follow<strong>in</strong>g: Onset > Ris<strong>in</strong>g Sonority > Strong Onset ><br />

*Complex > ICC Obstr (voi) > *rca > IDENT I-O (pal) > Weak Coda.<br />

Ris<strong>in</strong>g sonority applies to branch<strong>in</strong>g onsets. Let me also note that<br />

irrelevant constra<strong>in</strong>ts are not mentioned <strong>in</strong> the tableaux when not<br />

necessary.<br />

McCarthy (1998) ma<strong>in</strong>ta<strong>in</strong>s that by mak<strong>in</strong>g faithfulness constra<strong>in</strong>ts<br />

as selectors <strong>of</strong> the sympathetic candidate, opacity contributes to the<br />

notion <strong>of</strong> recoverability <strong>of</strong> underly<strong>in</strong>g representations. This notion was<br />

first <strong>in</strong>troduced by Kaye [1974: 146], who ma<strong>in</strong>ta<strong>in</strong>ed that cases <strong>of</strong><br />

derivations result<strong>in</strong>g <strong>in</strong> recoverability should not be considered unnatural<br />

and that “…languages show a positive predilection towards evolv<strong>in</strong>g<br />

recoverable derivations”.<br />

McCarthy uses recoverability to say that if an opaque <strong>in</strong>teraction<br />

gives a segment, which does not occur anywhere else, the derivation can<br />

be <strong>in</strong>vertable: e.g. /alevria/ is recoverable from [alefka] as the presence <strong>of</strong><br />

10 Alternative syllabifications can be proposed here, too.<br />

36

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

Saved successfully!

Ooh no, something went wrong!