Minimalist Grammar Transition-Based Parsing

DOI10.1007/978-3-662-53826-5_17zbMath1483.68151OpenAlexW2555555748MaRDI QIDQ2964012

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

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

• Structural similarity within and among languages
• Principles and implementation of deductive parsing
• Systems of syntactic analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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