Shift-Reduce CCG Parsing with a Dependency Model

Efficient Stacked Dependency Parsing by Forest Reranking

This paper proposes a discriminative forest reranking algorithm for dependency parsing that can be seen as a form of efficient stacked parsing. A dynamic programming shift-reduce parser produces a packed derivation fores…

A Gamification of Japanese Dependency Parsing

Gamification approaches have been used as a way for creating language resources for NLP. It is also used for presenting and teaching the algorithms in NLP and linguistic phenomena. This paper argues about a design of gam…

Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time

We present a new cubic-time algorithm to calculate the optimal next step in shift-reduce dependency parsing, relative to ground truth, commonly referred to as dynamic oracle. Unlike existing algorithms, it is applicable …

Learning PyTorch Through A Neural Dependency Parsing Exercise

Dependency parsing is increasingly the popular parsing formalism in practice. This assignment provides a practice exercise in implementing the shift-reduce dependency parser of Chen and Manning (2014). This parser is a t…

A Shift-Reduce Parsing Algorithm for Phrase-based String-to-Dependency Translation