Dissertation - Michael Becker

(161)*VÙV 〈taÙ,IDENTσ1 〉 IDENT(voice) σ1 *VÙV 〈aÙ,IDENTσ1 〉a. taÃ-1 ≻ taÙ-1 W Lb. aÙ-1 ≻ aÃ-1 W LOnce *VÙV is cloned, RCD can apply to the Support exactly as described in (159):First, *VÙV 〈taÙ,IDENT(voice)σ1 〉 is installed, and the first winner-loser pair is removed fromthe Support. Then, IDENT(voice) σ1 is installed, and the second winner-loser pair isremoved.With the Support emptied out, RCD is done, and the constraint that wasleft over, *VÙV 〈aÙ,IDENT(voice)σ1 〉, is added at the bottom of the hierarchy.The resultingstratified constraint hierarchy, or the grammar, is *VÙV 〈taÙ,IDENT(voice)σ1 〉 ≫ IDENT(voice) σ1≫ *VÙV 〈taÙ,IDENT(voice)σ1 〉.The Cloning RCD Algorithm takes a Support and returns a stratified constrainthierarchy, just like the original RCD as given in (159).The Cloning RCD differs bypotentially returning a hierarchy in which some constraints are cloned.The cloning RCD is described formally in (162). It is identical to the original RCDin its installation procedure (162a,b). Cloning is triggered by a non-empty Support thathas no constraints available for installing (162c). The algorithm chooses a constraint toclone by considering relevant candidates. Candidates for cloning are constraints that haveat least one W in their column (162c-i). Naturally, candidates for cloning also have atleast one L in their column, since if there were any constraints that had at least one Wand no L’s in their column, they could have been installed directly, without cloning. Ofthe candidates for cloning, constraints that have the smallest total of W’s and L’s in theircolumn are preferred (162c-ii). If multiple constraints tie for the fewest W’s and L’s, oneof them is chosen at random (162c-iii). Then, the cloning subroutine (described in 163and 167 below) is called, which takes the current Support and the constraint to clone, and166