Towards a Minimalist Machine: a stack-based architecture

SandiwayFongUniversityofArizona

sandiway@email.arizona.edu

JasonGinsburgOsakaKyoikuUniversity

jginsbur@cc.osaka-kyoiku.ac.jp

TalkContents

•  Background •  Problems with Spellout •  The Stack Architecture

Background

Example:Linguistsaretoughtoplease(Hicks,2009)Stream:[[linguists!D],[d!case!N],[pro!case],[please],[v*!phi],

[[PRO!D],[d!case!N]],[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

hPp://www.dingo.sbs.arizona.edu/~sandiway/mpp/mm.html

search:sandiwayminimalist

Background

•  Stream:–  [[linguists!D],[d!case!N],[pro!case],[please],[v*!phi],[[PRO!D],[d!case!N]],[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

Terminology:!F=(currently)unvalueduninterpretablefeatureF

Merge !

Background•  Stream:

–  [[pro!case],[please],[v*!phi],[[PRO!D],[d!case!N]],[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

•  SO:Merge !

Background

•  Stream:–  [[please],[v*!phi],[[PRO!D],[d!case!N]],[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

•  SO:Merge !

•  DoublingConsVtuent(Kayne,2002)

Background

•  Stream:–  [[[PRO!D],[d!case!N]],[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

•  SO:Merge !

"Substream"

probe

!phi !value ACC !

phi !!case !

Background

•  Stream:–  [ ,[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

•  SO:Merge !

re-insertsubstreamSObackin…

Background

•  Stream:–  [[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

•  SO:

SubstreamComputaVonThedriverofthecarcausedascandal

substreamtoformthecomplexsubject

(adaptedfromChomsky,2008)

SubstreamComputaVon•  Pair-merge:adjunctandargument

substreamtoformtheadjunct

jointworkM.Larcom

Background

•  Stream:–  [[Tinf!phi],[c],[tough],[vbe],[T!phi],[c]] !

•  SO:Merge !

Background•  Stream:

–  [[c],[tough],[vbe],[T!phi],[c]] !

•  SO:

Merge !

Background•  Stream:

–  [[c],[tough],[vbe],[T!phi],[c]] !

•  SO:

Background•  Stream:

–  [[T!phi],[c]] !•  SO:

Merge !

Background•  Stream:

–  [[c]] !•  SO: Merge !

!phi !value NOM !

phi !!case !

Background

Spelloutofthefron>eroftheSO

Background

Linguistsaretoughtoplease

Spelloutofthefron>eroftheSO1.  spellout(abstract)morphemes2.  affix-hop

ComputaVonalEfficiency

•  Twoaspects:– Minimize(probe-goal)search– Economy(probe-goaltwofer)

Spellout•  Chomsky(2001):

–  "Thesimplestassump>onisthatthephonologicalcomponentspellsoutelementsthatundergonofurtherdisplacement–theheadsofchains–withnoneedforfurtherspecifica>on."

–  Underthesimplestassump>ons,aprincipleofphonologyspellsKoutatitshighest(i.e.,maximal)occurrenceinthecourseofthecyclicderiva>on,asalreadydiscussed;andsurfaceinterpreta>onaOends(atleast)tothehighestoccurrenceaswell.

Constraints

•  InthecourseofaderivaVon:–  no(new)featurescanbeintroduced•  noFreeIndexaVon,•  no(explicit)Chainfeatures(cf.P&Pframework),etc.

–  nonewconsVtuentscanbeintroduced• Movecreatesexactcopies

•  Stream:[[linguists!D],[d!case!N],[pro!case],[please],[v*!phi],[[PRO!D],[d!case!N]],[Tinf!phi],[c],[tough],[vbe], ![T!phi],[c]] !

employKayne-styleDoublingConsVtuentforsyntacVcBinding:[DC[he][John]]

Spellout:TDLR

•  Top-down,lee-to-right(TDLR):

1

2 3 John 4-edocc(_) !occ(1) !

5 6occ(1) !

JohnJohn 7

8 see

9 10Maryaffix-hop

saw

Spellout

•  Example:Linguistsaretoughtoplease(Hicks,2009)Formalfeatureocc:•  Eachheadhasunvaluedocc(_) !•  Allcopieswillsharethesameocc(_)SpelloutPolicy:•  Spellheadoutifunvaluedocc(_).Thenvalueit.•  Don'tspelloutifvalued.

occ(_) !occ(1) !

occ(1) !

occ(1) !

linguists

BackwardsBinding•  PicturesofhimselfiworryJohni (Belllel&Rizzi,1988)

⓵⓶

TDLRSpellout:•  *PicturesofhimselfJohnworry

A

B

CheadofchainforDPJohn

occ(_) !

occ(_) !

occ(_) !

occ(1) !

occ(1) !

occ(1) !

BackwardsBinding•  PicturesofhimselfiworryJohni

occ(_) !

occ(1) !

occ(1) !

12

34

5

6

Move:•  Copy,createnewunvaluedocc(_).Valueoldcopy.SpelloutPolicy:•  Spellheadoutifunvaluedocc(_).Thenvalueit.•  Don'tspelloutifvalued.

Moremovement•  Johnithinksthatheissmarti (Kayne,2002)

Previousslide:1.  ExtractasubconsVtuent2.  MovelargerconsVtuentpastitThisslide:1.  MovethelargerconsVtuentfirst2.  FurtherextractasubconsVtuent

occ(_) !

occ(1) !

occ(1) !occ(1) !

occ(_) !

occ(1) !

MovementaccountofrelaVveclauses•  ThepictureofhimselfithatBillilikes (Munn,1994)

1.  ExtractasubconsVtuent2.  MovethelargerconsVtuentpastit3.  ExtractyetanothersubconsVtuent

1

2

34

5

6

7

MovementaccountofrelaVveclauses•  ThepictureofhimselfithatBillilikes

StackArchitecture

•  Isitconceptuallynecessary?

•  ComputaVonalEfficiency– Twoaspects:• Minimize(probe-goal)search• Economy(probe-goaltwofer)

NO

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught (Chomsky,2001)

!phi !value NOM !

phi !!case !

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught

•  MergeAandB!F•  PushB!Fontostack

SignalsthatthereisanoperaVonsVllpending

•  Anewheadprobes,•  JustlookattheTOS

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught

!phi(Num) !!case !

phi !!case !

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught

!phi(Per) !

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught

!phi !

phi !!case !

•  Whenanewheadprobes,•  CanmatchmulVplegoalsonstack

!phi(Per) !

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught

!phi !value NOM !

phi !!case !

Minimizeprobe-goalsearch•  Thereseemtohavebeenseveralfishcaught

phi !!case !

Mergematrix[T!phi]fromthestream

•  AccesstocurrentSOunnecessary•  forprobe-goalsearch,and•  move

Thereisonlythestack….

SubstreamsandStacks1.  Whichcardidtheyfindthedriverof?(Chomsky,2008)2.  *Ofwhichcardidthedrivercauseascandal?

(Thedriverofthecarcausedascandal)

SubstreamsandStacks1.  Whichcardidtheyfindthedriverof?(Chomsky,2008)2.  *Ofwhichcardidthedrivercauseascandal?

(Thedriverofthecarcausedascandal)

SubstreamsandStacks1.  Whichcardidtheyfindthedriverof?(Chomsky,2008)2.  *Ofwhichcardidthedrivercauseascandal?

(Thedriverofthecarcausedascandal)

•  SubstreamSOreinserted•  Substreamstackmerged?•  No•  Islandeffects

SubstreamsandStacks1.  Whichcardidtheyfindthedriverof?(Chomsky,2008)2.  *Ofwhichcardidthedrivercauseascandal?

(Thedriverofthecarcausedascandal)

SubstreamsandStacks1.  Whichcardidtheyfindthedriverof?(Chomsky,2008)2.  *Ofwhichcardidthedrivercauseascandal?

(Thedriverofthecarcausedascandal)!wh !!T !scope !

!case (valued) !!scope !wh !

StackAccess1.  Whichcardidtheyfindthedriverof?(Ofwhichcardidtheyfindthedriver?)

StackAccess•  InterrogaVveC:–  hasuninterpretableWhandTfeatures1.  Merge [cQ!wh!T] !2.  Relativized TOS search for iF(wh) skipping

[d[d][they]] !3.  Relativized TOS search for iF(wh) skipping

[the[the][driver[driver..][of..]]] !4.  [which!scope[which!scope][car]] values wh

on [cQ!wh!T] !5.  [d[d][they]] values T on [cQ!T] !

LocalExtent(cf.Phase)Boundaries•  Johnithinks[thatMarylikeshimselfi]

LocalExtent(cf.Phase)Boundaries•  *John1thinksheself1issmart