Dissertation - Michael Becker

more likely than the accusative to cause inter-vocalic voicing, or vice versa: In additionto nouns like avuÙ, which voice in the possessive but not in the accusative, there are alsoroots that voice in the accusative but not in the possessive, such as kukuÙ ‘stone (of a fruit)’,possessive kukuÙ-u, accusative kukuÃ-u.In the current proposal, the learner is free to learn the behavior of each root and affixcombination separately if they have observed this behavior in the ambient language. Theyare not forced to assign a single behavior to each root. The learner is biased, however, toassign consistent behavior to nouns across affixes, as discussed in §4.3.4. If some noun hasbeen observed with a voiceless stop with one or more affixes, it is likely to have a voicelessstop in forms of the noun that the learner hasn’t observed yet. If a noun has been observedto alternate with some affixes and not to alternate with others, the speaker is free to chooseeither behavior with forms of the noun that they haven’t observed yet.The final version of the cloning subroutine of the Cloning RCD Algorithm is given in(167) below. It differs from (163) in the kind of object that is added to the domain of aclone. Rather than adding an ordered pair of a winner and conflicting constraints, (167)defines an ordered triplet of a stem, an affix and a set of conflicting constraints. If thewinner is mono-morphemic, it is defined as the stem, and the affix slot remains empty(167e). If the winner is poly-morphemic, it is decomposed into its immediate constituents,i.e. the outermost affix and the stem that it attaches to. The outermost affix refers to thehighest affix in a morphological tree structure, or in a derivational model, the last affix in aderivation.(167) Cloning subroutine (final version)Given a support S and a constraint to clone C ∈ S,a. general constraints := constraints that assign a superset of the W’s and L’sthat C assigns.b. C W := C L := a constraint such that for any x, C(x) = C W (x) = C L (x).173