Order and Optionality: Minimalist Grammars with Adjunction

Tree Adjunction as Minimalist Lowering

Automatic Inference of Minimalist Grammars using an SMT-Solver

We introduce (1) a novel parser for Minimalist Grammars (MG), encoded as a system of first-order logic formulae that may be evaluated using an SMT-solver, and (2) a novel procedure for inferring Minimalist Grammars using…

Expectation-based Minimalist Grammars

Expectation-based Minimalist Grammars (e-MGs) are simplified versions of the (Conflated) Minimalist Grammars, (C)MGs, formalized by Stabler (Stabler, 2011, 2013, 1997) and Phase-based Minimalist Grammars, PMGs (Chesi, 20…

A Sound and Complete Left-Corner Parsing for Minimalist Grammars

This paper presents a left-corner parser for minimalist grammars. The relation between the parser and the grammar is transparent in the sense that there is a very simple 1-1 correspondence between derivations and parses.…

Wide-Coverage Neural A* Parsing for Minimalist Grammars

Minimalist Grammars (Stabler, 1997) are a computationally oriented, and rigorous formalisation of many aspects of Chomsky{'}s (1995) Minimalist Program. This paper presents the first ever application of this formalism to…