Hierarchical Pointer Net Parsing

08/30/2019
by   Linlin Liu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2021

Dependency Parsing with Bottom-up Hierarchical Pointer Networks

Dependency parsing is a crucial step towards deep language understanding...
research
06/24/2020

Efficient Constituency Parsing by Pointing

We propose a novel constituency parsing model that casts the parsing pro...
research
06/24/2017

Encoder-Decoder Shift-Reduce Syntactic Parsing

Starting from NMT, encoder-decoder neu- ral networks have been used for ...
research
11/08/2019

Graph-to-Graph Transformer for Transition-based Dependency Parsing

Transition-based dependency parsing is a challenging task for conditioni...
research
05/03/2018

Stack-Pointer Networks for Dependency Parsing

We introduce a novel architecture for dependency parsing: stack-pointer ...
research
06/29/2020

Leveraging Subword Embeddings for Multinational Address Parsing

Address parsing consists of identifying the segments that make up an add...
research
10/15/2019

Text2Math: End-to-end Parsing Text into Math Expressions

We propose Text2Math, a model for semantically parsing text into math ex...

Please sign up or login with your details

Forgot password? Click here to reset