SOTAVerified

Hierarchical Pointer Net Parsing

2019-08-30IJCNLP 2019Code Available0· sign in to hype

Linlin Liu, Xiang Lin, Shafiq Joty, Simeng Han, Lidong Bing

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Transition-based top-down parsing with pointer networks has achieved state-of-the-art results in multiple parsing tasks, while having a linear time complexity. However, the decoder of these parsers has a sequential structure, which does not yield the most appropriate inductive bias for deriving tree structures. In this paper, we propose hierarchical pointer network parsers, and apply them to dependency and sentence-level discourse parsing tasks. Our results on standard benchmark datasets demonstrate the effectiveness of our approach, outperforming existing methods and setting a new state-of-the-art.

Tasks

Reproductions