Minimalist Grammar Transition-Based Parsing

DOI10.1007/978-3-662-53826-5_17zbMATH Open1483.68151OpenAlexW2555555748MaRDI QIDQ2964012FDOQ2964012

Miloš Stanojević

Publication date: 22 February 2017

Published in: Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53826-5_17

Recommendations

• scientific article; zbMATH DE number 1560210
• Dependency structures derived from minimalist grammars
• Minimalist grammars in the light of logic
• Minimization of context-free grammars
• The smallest grammar problem as constituents choice and minimal grammar parsing
• Movement-Generalized Minimalist Grammars
• Parsing beyond context-free grammars
• Logical Aspects of Computational Linguistics
• scientific article; zbMATH DE number 2150279

zbMATH Keywords

minimalist grammarsshift-reduce parsingswap transitiontransition-based parsingtwo-stack automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Derivational minimalism
• Title not available (Why is that?)
• Systems of syntactic analysis
• Structural similarity within and among languages
• Principles and implementation of deductive parsing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Movement-Generalized Minimalist Grammars
• Title not available (Why is that?)
• Late Merge as Lowering Movement in Minimalist Grammars
• A Single Movement Normal Form for Minimalist Grammars

This page was built for publication: Minimalist Grammar Transition-Based Parsing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964012)