Machine: Minimalist Derivations

Examples:
  1. Basic sentence patterns: expand
  2. Derivation by Phase (Chomsky 2001): expand
  3. On Phases (Chomsky, 2008): expand
  4. T-to-C Movement: Causes and Consequences. Pesetsky & Torrego (2001). expand
  5. Explaining TH/EX (Sobin, ms.) and TH/EX, Agreement, and Case in Expletive Sentences (Sobin, 2014). expand
  6. Computation with doubling constituents: Pronouns and antecedents in Phase Theory. (Fong & Ginsburg, 2012). expand
  7. Modeling of Coreference Relations in Multi-Object Constructions. (Fong & Ginsburg, 2012b). expand
  8. Examples from A New Approach to Tough-Constructions (Fong & Ginsburg, 2014).
    Doubling Constituent (DC) approach. expand
    Case-theoretic approach. expand
  9. Relative clause constructions: inspired by (Gallego, 2010) and (Chen, (p.c.)). expand
  10. Test cases from A Course in GB Syntax (Lasnik & Uriagereka,1988). expand
  11. Arabic examples collapse
    Example Instruction stream (clickable) Notes
    ┘Е╪з ╪и┘К╪▒┘И╪н┘И╪з
    ma b-yruuH-u
    neg indic.imperf go.they
    "They don't go (out)"
    [ruuH, v_unerg, [pro_henna,d], t_imperf, indic, neg, c] (Brustad 2000:122)
    ╪к╪╣┘Д┘Е╪к ╪з┘Д┘Д╪║╪й ┘Е┘Ж ╪м┘К╪▒╪з┘Ж┘Ж╪з
    tEallm-t el-lugha min jiiran-na
    learned.1st.sg. the-language.f from neighbors.m-our
    I learned the language from our neighbor
    [lugha, el, [jiiraan, poss, [niHna,d], min], tEallm, v_trans, [pro_ana,d], t_perf, c] Pair-merge.
    ╪и┘К╪▒┘И╪н┘И ╪и┘З╪з┘Д╪╣╪к┘Е╪й
    b-y-ruuH-u bi-ha- el-╩Хatma
    indic-go.3rd.pl.m in- the-darkness.f
    [aEtma, el, ha, bi, ruuH, v_unerg, [pro_henna,d], t_imperf, indic, c] Brustad 2000:118
    ┘Е╪з ┘К╪┤┘И┘Б┘И╪з ╪з┘Д╪╣╪▒┘И╪│ ┘Д┘Д┘К┘Д╪й ╪з┘Д╪╣╪▒╪│
    maa y-shuuf-u el-╩Хaruus la-lelt el-╩Хars
    neg see.3rd.pl.m the-bride.f until-night.f the-wedding.m
    "they used to not see the bride until the night..."
    [aEruus, el, [aErs, el, gen, lelt, d, la], shuuf, v_trans, [pro_henna, d], t_imperf, neg, kaan, c] This is currently the abbreviated version of the full phrase kaan-u maa y-shuuf-u el-╩Хaruus la-lelt el-╩Хars. Was.3rd.pl.m neg. see.3rd.pl.m the-bride.f until-night.f of-the-wedding.m
    Pair-merge.
    ╪м╪з╪и ┘Д┘З ╪╡╪н┘Ж ╪и┘И╪╕╪й
    zhaab l-u SaHn buuDHa
    brought.3rd.sg.m to-him plate.m (of).ice-cream.f
    he brought him a plate of ice cream
    [buuDHa, d, gen, saaHn, d, [huwa, d, l], zhaab, v_trans, [pro_huwa, d], t_perf, c] A phrase from the full sentence "zhaab l-u SaHn buuDHa Saar y-aakl-u bi-el-khebez" he brought him a plate of ice cream, he began to eat it with bread. Pair Merge with spliced PP.
    ┘К┘Г┘И┘Ж┘И╪з ╪╣┘Е ╪и┘К╪к┘Е╪┤┘С┘И╪з ╪и╪з┘Д╪┤╪з╪▒╪╣
    y-kuun-u ╩Хam b-y-tmashh-u bi-el-shaar╩Хa
    was.3rd.pl.m prog. indic-walk.3rd.pl.m in-the-street.m
    ...they'd be walking in the street
    [shaarEa, el, bi, tmashh, v_unerg,[pro_henna,d], t_imperf, indic, 'Eam', kaan, c] Brustad 2000:216
    ╪з┘Д╪╢╪з╪▒ ┘Е╪з ┘Г╪и┘К╪▒╪┤
    eD-Dar maa kbir-a-sh
    the-house.f.sg. not big.f.-not
    the house is not big
    [dar, el, kbira, t, neg, c] In some dialects, e.g. Moroccan and Jordanian, negation is split into maa + -sh.
    -sh affix hops over the predicate root.
  12. Japanese examples (Miyagawa 2001) expand
Input:
Size: (x1) (x4)
Websocket: 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED 8010 CONNECTED DISCONNECTED

Machine Parameters: expand

Animation:
╪з┘Д╪╢╪з╪▒ ┘Е╪з ┘Г╪и┘К╪▒╪┤
eD-Dar maa kbir-a-sh
the-house.f.sg. not big.f.-not
the house is not big

Derivation:
╪з┘Д╪╢╪з╪▒ ┘Е╪з ┘Г╪и┘К╪▒╪┤
eD-Dar maa kbir-a-sh
the-house.f.sg. not big.f.-not
the house is not big

Stream:[[dar!D],[el!case!N],[kbira],[t!phi],[neg],[c]]
Stack (тее):
SO:[]

Step 1.

Merge [el!case!N] and [dar!D]
Label from [el!case!N] (head with an unvalued uF)
Inherit interpretable [f(phi,[3,sg,f])] from [dar!D]
[el!case!N] values D on [dar!D]
[dar] values N on [el!case!N]
Stream:[[kbira],[t!phi],[neg],[c]]
Stack (тее):
SO:[el!case[el][dar]]

Step 2.

Merge [kbira] and [el!case[el][dar]]
Label from [kbira] (head merging with a non-head)
Push [el!case[el][dar]] (unvalued uF) onto stack
Stream:[[t!phi],[neg],[c]]
Stack (тее):[el!case[el][dar]]
SO:[kbira[kbira][el!case[el][dar]]]

Step 3.

Merge [t!phi] and [kbira[kbira][el!case[el..][dar..]]]
Label from [t!phi] (head merging with a non-head)
[el!case[el][dar]] values uPhi on [t!phi]
[t] values nom case on [el!case[el][dar]]
Stream:[[neg],[c]]
Stack (тее):[el[el][dar]]
SO:[t[t][kbira[kbira][el[el][dar]]]]

Step 4.

Internal merge selected
Merge [t[t][kbira[kbira..][el..]]] and [el[el][dar]]
Label from [t[t][kbira[kbira..][el..]]] (edge feature)
Stream:[[neg],[c]]
Stack (тее):[el[el][dar]]
SO:[t[el[el][dar]][t[t][kbira[kbira][el[el][dar]]]]]

Step 5.

Merge [neg] and [t[el[el..][dar..]][t[t..][kbira..]]]
Label from [neg] (head merging with a non-head)
Stream:[[c]]
Stack (тее):[el[el][dar]]
SO:[neg[neg][t[el[el][dar]][t[t][kbira[kbira][el[el][dar]]]]]]

Step 6.

Internal merge selected
Merge [neg[neg][t[el..][t..]]] and [el[el][dar]]
Label from [neg[neg][t[el..][t..]]] (edge feature)
Stream:[[c]]
Stack (тее):[el[el][dar]]
SO:[neg[el[el][dar]][neg[neg][t[el[el][dar]][t[t][kbira[kbira][el[el][dar]]]]]]]

Step 7.

Merge [c] and [neg[el[el..][dar..]][neg[neg..][t..]]]
Label from [c] (head merging with a non-head)
Stream:[]
Stack (тее):[el[el][dar]]
SO:[c[c][neg[el[el][dar]][neg[neg][t[el[el][dar]][t[t][kbira[kbira][el[el][dar]]]]]]]]

Parse:
Spell-out:
el~ dar maa -sh kbira (after morpheme realization)
el~ dar maa kbira -sh (after affix-hop)
el~ dar maa kbira -sh (after morpheme realization, stage 2)
el-dar maa kbira-sh  

One derivation found.
Computational Cost:
Merge: 7, Agree: 4, Unify: 0, Push: 1, Boundaries: 0, Inject: 0
Non-TOS access: 0, Pop: 0, Depth cost: 0
Step:01234567
Stack depth:00111111

Back to top