Docs / Studies / Studies.DeVries2009
de Vries, M. (2009). Biolinguistics, 3, 344–403
Merge applies to roots and to terms alike, so a term can be remerged inside its own root, internal remerge, which is movement, or with another root, external remerge, which is sharing (§2). PF traverses the resulting graph and pronounces a remerged node once: at its highest position when it moved, and at its last when it is shared. De Vries's spell-out of remerged nodes, (56), linearizes a node with several parents when no parent dominates the current one and either every parent has been traversed or the current parent dominates every parent not yet traversed; his algorithm (71) implements it by indexing each node when it is visited.
double, α is shared by γ₁ = [g α] and γ₂ = [w α], and γ₂ by δ₁
and δ₂, with δ₁ before γ₁ before δ₂. α is linearized under γ₁, γ₂ having been traversed, and
omitted, under δ₁, and again under γ₂ once δ₂ linearizes it, against the paper's requirement that
only one occurrence of a linguistic object be overtly realized (p. 376).The index of g after the visits log: the position of its last visit, counting from one, and
zero when it has not been visited.
Lines 9–13 of (71): the node s, just indexed, is linearized when it has at most one parent,
or when no parent dominates the current parent, the parent with the highest index, and either
every parent has an index or the current parent dominates every parent without one.
The definition is too large to print here; read it in the source.
Used by instDecidableLinearizes, scan
The definition is too large to print here; read it in the source.
Built from
The procedure scangraph of (71): index the node, and when it is linearized traverse its
daughters in order, or add it to the string when it is a terminal.
The definition is too large to print here; read it in the source.
Built from
Used by scanList, linearization
scangraph on the daughters of a node, left to right.
Built from
The algorithm (71): the string of terminals scangraph produces from the root.
Built from
B is remerged from C into the root R; /B D A/.
Built from , ,
Used by movement_examples, remergedYield_movement
B is shared by C in the first conjunct and E in the second; /F A Co H D B/.
Built from , , , , ,
Used by sharing_examples, remergedYield_sharing
The phrase α = [x y] is remerged from γ₁ into γ₂; /x y δ β1/.
Built from , , ,
Used by movement_examples, remergedYield_movement
Α is shared by γ₁ and γ₂; /δ1 β1 δ2 β2 α/.
Built from , , , ,
Used by sharing_examples, remergedYield_sharing
Α is internally remerged twice and pronounced at its highest position.
Built from , , ,
Used by movement_examples, remergedYield_movement
Α is externally remerged twice and pronounced under the last parent.
Built from , , ,
Used by sharing_examples, remergedYield_sharing
Α moves within β, which moves in turn; β and, inside it, α are pronounced high.
The definition is too large to print here; read it in the source.
Roll-up movement pronounces the heads in the mirror order of first Merge, X Y Z.
Built from , ,
Used by movement_examples, remergedYield_movement
The examples with their strings: printed in the paper for (41), (42), (47) and (48), and otherwise those its choice of the pronounced occurrence gives.
The definition is too large to print here; read it in the source.
(71) yields the strings the paper intends for its examples.
Built from ,
Pronouncing each node under its highest mother pronounced last, the spell-out of
Linearization/Multidominance.lean, yields them too.
Built from
(71) pronounces α twice.
Built from , , , , , ,
Pronouncing each node under its highest mother pronounced last pronounces α once.
Built from , , , , ,
Built from , , ,
Built from , , ,
Built from
External remerge alone pronounces each node at its last occurrence.
Built from , , ,
Internal remerge alone pronounces each node at its highest occurrence, whichever highest mother is chosen.
Built from , , ,