{α : Type u_1} {X Y Z a : α} [DecidableEq α] (hnd : [X, a, Y, Z].Nodup) :
Minimalist.Linearization.Consistent [[X, Y, Z], [X, a, Y, Z]]
Docs / Studies / Studies.FoxPesetsky2005
Cyclic Linearization of Syntactic Structure
Fox, D. & Pesetsky, D. (2005). Theoretical Linguistics, 31(1--2), 1–45
This file formalizes Fox & Pesetsky 2005's account of successive cyclicity and Holmberg's
Generalization under cyclic linearization (Minimalist.Linearization.Consistent). The
derivational scenarios (13)–(15) are theorems over arbitrary terminals: movement from the left
edge of a domain converges, movement from a non-edge position crashes on the pair it reorders,
and moving the edge material along restores the order. Swedish Object Shift is these scenarios
with the verb, the object and an intervener as the terminals. The derivations the paper sketches
for its sentences spell out the snapshots it draws (Sketch.spellouts_eq_phases), and whether
they linearize predicts the sentences' judgments (rows_predicted).
References
- Fox & Pesetsky 2005, Cyclic Linearization of Syntactic Structure
Derivational scenarios
{α : Type u_1} {X Y Z a : α} [DecidableEq α] (hnd : [X, Y, a, Z].Nodup) :
Minimalist.Linearization.Consistent [[X, Y, Z], [X, Y, a, Z]]
Holmberg's Generalization
{α : Type u_1} {S V O adv : α} [DecidableEq α] (hnd : [S, V, O, adv].Nodup) :
Minimalist.Linearization.Consistent [[V, O], [S, V, O, adv]]
{α : Type u_1} {S V O adv aux : α} :
¬Minimalist.Linearization.Consistent [[V, O], [S, aux, O, adv, V]]
{α : Type u_1} {S V O adv XP : α} :
¬Minimalist.Linearization.Consistent [[V, XP, O], [S, V, O, adv, XP]]
{α : Type u_1} {S V O adv XP : α} [DecidableEq α] (hnd : [XP, V, S, O, adv].Nodup) :
Minimalist.Linearization.Consistent [[XP, V, O], [XP, V, S, O, adv]]
The Swedish data
A terminal is a word or phrase of the paper's Object Shift sketches.
Derives DecidableEq, Repr.
Used by Terminal.token, Terminal.ofToken?, Sketch.phases
Each terminal spells out its own lexical item.
Equations
- Terminal.S.token = { item := Minimalist.LexicalItem.of Minimalist.Cat.D [], id := 1 }
- Terminal.V.token = { item := Minimalist.LexicalItem.of Minimalist.Cat.V [], id := 2 }
- Terminal.O.token = { item := Minimalist.LexicalItem.of Minimalist.Cat.D [], id := 3 }
- Terminal.adv.token = { item := Minimalist.LexicalItem.of Minimalist.Cat.Neg [], id := 4 }
- Terminal.C.token = { item := Minimalist.LexicalItem.of Minimalist.Cat.C [], id := 5 }
- Terminal.aux.token = { item := Minimalist.LexicalItem.of Minimalist.Cat.T [], id := 6 }
- Terminal.XP.token = { item := Minimalist.LexicalItem.of Minimalist.Cat.P [], id := 7 }
Built from
Used by Sketch.vpSteps, Sketch.derivation
A lexical item spells out at most one terminal.
The definition is too large to print here; read it in the source.
Built from
Used by Sketch.spellouts_eq_phases
The paper sketches the derivation of an Object Shift sentence as one of (20)–(22), (24) and (26).
- verbToC : Sketch
The finite verb moves to C (20).
- embedded : Sketch
The complementizer of an embedded clause keeps the verb in VP (21).
- auxiliary : Sketch
An auxiliary moves to C and the verb stays in VP (22).
- intervener : Sketch
A first object or particle precedes the object in VP (24).
- intervenerFronted : Sketch
The intervener fronts through the VP edge (26).
Derives DecidableEq, Repr.
Used by Sketch.vpSteps, Sketch.cpSteps, Sketch.derivation, Sketch.schedule, Sketch.phases, Sketch.spellouts_eq_phases, Sketch.table
The VP of a sketch is the verb with its object, preceded in (24) and (26) by the intervener, which in (26) moves to the VP edge.
The definition is too large to print here; read it in the source.
Built from ,
Used by Sketch.derivation, Sketch.schedule
Above the VP the adverb adjoins, the object shifts and the subject merges, and then the verb, the auxiliary or the intervener moves to C, as the bracketings (20b)–(22b), (24) and (26) show.
The definition is too large to print here; read it in the source.
Built from
Used by Sketch.derivation
A sketch's derivation starts from the verb.
- s.derivation = { initial := ↑Terminal.V.token, steps := s.vpSteps ++ s.cpSteps }
Built from , , ,
Used by Sketch.schedule, Sketch.spellouts_eq_phases, rows_predicted
The VP is spelled out when it is built, and the CP at the end of the derivation.
- s.schedule = [(s.vpSteps.length, s.vpSteps.length), (s.derivation.length, s.derivation.length)]
Built from , ,
Used by Sketch.spellouts_eq_phases, rows_predicted
The paper draws these VP and CP snapshots.
The definition is too large to print here; read it in the source.
Built from ,
Used by Sketch.spellouts_eq_phases
(s : Sketch) :
List.map (fun (p : ℕ × ℕ) => List.filterMap Terminal.ofToken? (s.derivation.spellout p.1 p.2)) s.schedule = s.phases
Built from , , , ,
These feature values name the sketches in the example data.
The definition is too large to print here; read it in the source.
Built from
Used by rows_predicted
(ex : Datum) :
ex ∈ Examples.all → ∀ s ∈ ex.parse? "sketch" Sketch.table, ex.judgment = Judgment.acceptable ↔ s.derivation.Linearizes s.schedule
Built from , ,