Inferring Minimalist Grammars with an SMT-Solver
- Sagar Indurkhya (Massachusetts Institute of Technology)
Abstract
We present an implemented novel procedure for inferring Minimalist Grammars (MG). Our procedure models an MG as a system of first-order logic formulae that is evaluated with the Z3 SMT solver. The input to the procedure is a sequence of sentences annotated with syntactic relations encoding predicate-argument structure and subject-verb agreement. The implementation outputs a set of MGs that can parse each input sentence, yielding the same syntactic relations as in the original input. We present and analyze how MGs inferred by this procedure align with contemporary theories of minimalist syntax.
Keywords: minimalist grammars, satisfiability modulo theories, grammar inference
How to Cite:
Indurkhya, S., (2020) “Inferring Minimalist Grammars with an SMT-Solver”, Society for Computation in Linguistics 3(1), 476-479. doi: https://doi.org/10.7275/d9g5-7e33
Downloads:
Download PDF