Combination Schemata #
Three universal combination schemata shared across syntactic theories. @cite{mueller-2013} argues that Minimalism, HPSG, CCG, DG, and Construction Grammar converge on these three modes of binary combination, though with different terminology and formalisms. Abstracted from HPSG's immediate dominance schemata (@cite{pollard-sag-1994}).
Three universal combination schemata shared across syntactic theories.
@cite{mueller-2013} argues that every syntactic theory implements these three modes of combination, though with different terminology.
- headComplement : CombinationKind
Head combines with its complement (selected argument). Minimalism: External Merge (with selection); HPSG: Head-Complement Schema; CCG: forward/backward application; DG: core dependency (obj, det,...).
- headSpecifier : CombinationKind
Head combines with its specifier (non-selected argument). Minimalism: External Merge (without selection); HPSG: Head-Subject Schema; CCG: backward application (subject may be type-raised); DG: subject dependency.
- headFiller : CombinationKind
Filler combines with a gapped structure (long-distance dependency). Minimalism: Internal Merge; HPSG: Head-Filler Schema; CCG: harmonic composition (primarily; composition also serves other functions like heavy NP shift); DG: non-projective dependency.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Core.instReprCombinationKind = { reprPrec := Core.instReprCombinationKind.repr }
Equations
- Core.instBEqCombinationKind.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)