When no token is merged twice, a derivation pronounces each token it merges once, in its object or in a copy left on the stack, however many copies its movements leave.
Docs / Syntax / Minimalist / Linearization / ChainReduction
Chain reduction
import Linglib.Syntax.Minimalist.Linearization.ChainReduction · namespace Minimalist.Derivation
Externalization pronounces a moved constituent once and deletes its lower copies. The replay with traces deletes every lower copy at the step that moves it, so a derivation that merges no token twice and leaves no extracted copy on the stack pronounces each token it merges exactly once. That one copy is pronounced is the replay's choice: chain reduction explains why lower copies go unpronounced, and languages that spell out several copies of a wh-phrase show it is a choice of the externalization, not a law of the copy theory.
Main results
Minimalist.Derivation.yield_replay?: the pronounced tokens of a configuration are the merged tokens.Minimalist.Derivation.coe_surfaceTokens: each merged token is pronounced exactly once.Minimalist.Derivation.mem_yield_of_mem_lexTokens: a derivation of Merge steps pronounces every token it merges.
References
- Nunes 2004, Linearization of Chains and Sideward Movement
Declarations
When no token is merged twice and no extracted copy is left on the stack, the externalized object pronounces every token the derivation merges exactly once, the outcome Nunes 2004's chain reduction secures.
In a derivation of Merge steps with no token merged twice, every token merged is pronounced in its object.