Parsing Minimalist Languages with Interpreted Regular Tree Grammars
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
New syntactic insights for automated Wolof Universal Dependency parsing
Focus on language-specific properties with insights from formal minimalist syntax can improve universal dependency (UD) parsing. Such improvements are especially sensitive for low-resource African languages, like Wolof, …
Dependency ParsingBME-UW at SRST-2019: Surface realization with Interpreted Regular Tree Grammars
The Surface Realization Shared Task involves mapping Universal Dependency graphs to raw text, i.e. restoring word order and inflection from a graph of typed, directed dependencies between lemmas. Interpreted Regular Tree…
DecoderSemantic ParsingConstraining MGbank: Agreement, L-Selection and Supertagging in Minimalist Grammars
This paper reports on two strategies that have been implemented for improving the efficiency and precision of wide-coverage Minimalist Grammar (MG) parsing. The first extends the formalism presented in Torr and Stabler (…
Dependency-based Hybrid Trees for Semantic Parsing
We propose a novel dependency-based hybrid tree model for semantic parsing, which converts natural language utterance into machine interpretable meaning representations. Unlike previous state-of-the-art models, the seman…
Semantic ParsingWide-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…
Sentence