Incremental Acquisition of a Minimalist Grammar using an SMT-Solver

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…

Inferring Minimalist Grammars with an SMT-Solver

Grammar Induction for Minimalist Grammars using Variational Bayesian Inference : A Technical Report

The following technical report presents a formal approach to probabilistic minimalist grammar parameter estimation. We describe a formalization of a minimalist grammar. We then present an algorithm for the application of…

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.…