A Single Movement Normal Form for Minimalist Grammars Thomas Graf - PowerPoint PPT Presentation

MGs SMNF Proof Sketch Implications Conclusion A Single Movement Normal Form for Minimalist Grammars Thomas Graf Aniello De Santo Alëna Aksënova Stony Brook University mail@thomasgraf.net http://thomasgraf.net FG 2016 Aug 21, 2016

MGs SMNF Proof Sketch Implications Conclusion Take Home Message A mundane result. . . To simplify proofs, we define a strongly equivalent normal form for MGs where every phrase moves at most once . . . . opens many new research avenues! ◮ Computational parallels between syntax and phonology ◮ More direct connection to Dependency Grammar ◮ New approach to MCFL learning

MGs SMNF Proof Sketch Implications Conclusion Take Home Message A mundane result. . . To simplify proofs, we define a strongly equivalent normal form for MGs where every phrase moves at most once . . . . opens many new research avenues! ◮ Computational parallels between syntax and phonology ◮ More direct connection to Dependency Grammar ◮ New approach to MCFL learning

MGs SMNF Proof Sketch Implications Conclusion Outline Movement in Minimalist Grammars 1 Merge and Move Intermediate Movement The Shortest Move Constraint Single Movement Normal Form 2 Proof Sketch 3 Implications and Future Work 4 Theoretical Linguistics Formal Grammar

MGs SMNF Proof Sketch Implications Conclusion Minimalist Grammars (MGs) ◮ Minimalist grammars (MGs) are a formalization of Chomskyan syntax (Stabler 1997, 2011) ◮ Succinct formalism for defining MCFGs ◮ Operations: Merge and Move ◮ Grammar is just a finite list of feature-annotated lexical items (LIs) Chemistry Syntax atoms words electrons features molecules sentences 1

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . < the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . < the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . < < the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . < < the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . < < < the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . < < < the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge Merge combines subtrees to encode head-argument dependencies . category feature N − , V − , . . . selector feature N + , V + , . . . > < < < the men like which men N + D − D + D + V − N + D − N − N − ◮ the and men have matching features, triggering Merge ◮ same steps for which men ◮ like merged with which men ◮ like merged with the men 2

MGs SMNF Proof Sketch Implications Conclusion Merge in Derivation Trees > < < < the men like which men N + D − D + D + V − N + D − N − N − Derived Tree • • • • the men like which men N + D − D + D + V − N + D − N − N − Derivation Tree 3

MGs SMNF Proof Sketch Implications Conclusion Move Move displaces subtrees to derive the correct linear order . licensee feature wh − , top − , . . . licensor feature wh + , top + , . . . > do V + wh + C − < < < the men like which men N + D − D + D + V − N + D − wh − N − N − ◮ Merge do ◮ Move triggered by features of opposite polarity 4

MGs SMNF Proof Sketch Implications Conclusion Move Move displaces subtrees to derive the correct linear order . licensee feature wh − , top − , . . . licensor feature wh + , top + , . . . > do V + wh + C − < < < the men like which men N + D − D + D + V − N + D − wh − N − N − ◮ Merge do ◮ Move triggered by features of opposite polarity 4

MGs SMNF Proof Sketch Implications Conclusion Move Move displaces subtrees to derive the correct linear order . licensee feature wh − , top − , . . . licensor feature wh + , top + , . . . < > do V + wh + C − < < < the men like which men N + D − D + D + V − N + D − wh − N − N − ◮ Merge do ◮ Move triggered by features of opposite polarity 4

MGs SMNF Proof Sketch Implications Conclusion Move Move displaces subtrees to derive the correct linear order . licensee feature wh − , top − , . . . licensor feature wh + , top + , . . . < > do V + wh + C − < < < the men like which men N + D − D + D + V − N + D − wh − N − N − ◮ Merge do ◮ Move triggered by features of opposite polarity 4

MGs SMNF Proof Sketch Implications Conclusion Move Move displaces subtrees to derive the correct linear order . licensee feature wh − , top − , . . . licensor feature wh + , top + , . . . > < which men < N + D − wh − N − > do V + wh + C − < < t the men like N + D − D + D + V − N − ◮ Merge do ◮ Move triggered by features of opposite polarity 4

MGs SMNF Proof Sketch Implications Conclusion Move in Derivation Trees C D which men C N + D − wh − N − V do V + wh + C − V t D the men like N + D − D + D + V − N − ◦ • • do V + wh + C − • • • the men like which men N + D − D + D + V − N + D − wh − N − N − 5

MGs SMNF Proof Sketch Implications Conclusion Move in Derivation Trees C D which men C N + D − wh − N − V do V + wh + C − V t D the men like N + D − D + D + V − N − ◦ • • do V + wh + C − • • • the men like which men N + D − D + D + V − N + D − wh − N − N − 5

MGs SMNF Proof Sketch Implications Conclusion Intermediate Movement Intermediate Movement is possible, but does not affect string order. ◦ • > do ◦ v + wh + C − < < • which men do > v • V + case + v − t < • • v > • the men like N + D − D + D + V − N − < < which men N + D − case − wh − N − the men like t 6

MGs SMNF Proof Sketch Implications Conclusion An Important Restriction on MGs In order to ensure that MGs generate only MCFLs, movement must be restricted. Shortest Move Constraint (SMC) If two lexical items in a tree both have a licensee feature as their first currently unchecked feature, then these features must be distinct. > < < < which men like which men N + D − wh − D + D + V − N + D − wh − N − N − 7