DE eng

Search in the Catalogues and Directories

Hits 1 – 5 of 5

1
Incremental Acquisition of a Minimalist Grammar using an SMT-Solver
In: Proceedings of the Society for Computation in Linguistics (2022)
Abstract: We introduce a novel procedure that uses the Z3 SMT-solver, an interactive theorem prover, to incrementally infer a Minimalist Grammar (MG) from an input sequence of paired interface conditions, which corresponds to the primary linguistic data (PLD) a child is exposed to. The procedure outputs an MG lexicon, consisting of a set of (word, feature-sequence) pairings, that yields, for each entry in the PLD, a derivation that satisfies the listed interface conditions; the output MG lexicon corresponds to the Knowledge of Language that the child acquires from processing the PLD. We use the acquisition procedure to infer an MG lexicon from a PLD consisting of 39 simple sentences with at most one level of embedding. Notably, the inferred lexicon can generate a countably infinite set of derivations, including derivations with n-levels of embedding for any n>0, thereby generalizing beyond the input PLD. The acquisition procedure allows us to focus on specifying the learner’s initial state and conditions on the learner’s final state (imposed by the PLD), and leave to the solver questions of how the language-acquisition device goes from the initial state to the final state and what that final state is.
Keyword: Computational Linguistics; Derivation; Inference; Interface Conditions; Language Acquisition; Lexicon; MG; Minimalist Grammar; Minimalist Program; Minimalist Syntax; Modeling; Satisfiability Modulo Theories; SMT; SMT solver; Syntax; Z3
URL: https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1248&context=scil
https://scholarworks.umass.edu/scil/vol5/iss1/20
BASE
Hide details
2
Evaluating Universal Dependency Parser Recovery of Predicate Argument Structure via CompChain Analysis ...
BASE
Show details
3
Inferring Minimalist Grammars with an SMT-Solver
In: Proceedings of the Society for Computation in Linguistics (2020)
BASE
Show details
4
Colorless green ideas do sleep furiously: gradient acceptability and the nature of the grammar
In: De Gruyter (2019)
BASE
Show details
5
Acquiring minimalist grammars via constraint satisfaction
Indurkhya, Sagar. - : Massachusetts Institute of Technology, 2015
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
5
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern