# Hierarchical Pointer Net Parsing

arXiv: https://arxiv.org/abs/1908.11571 · HTML: https://mlsanity.com/paper/1908.11571/

## Key facts

- Cited by 8 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Aug 2019.

## Built on by (most cited first, 8 of 8)

- [Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks](https://mlsanity.com/paper/2110.05419/) (2021)
- [Headed-Span-Based Projective Dependency Parsing](https://mlsanity.com/paper/2108.04750/) (2021)
- [Top-down Discourse Parsing via Sequence Labelling](https://mlsanity.com/paper/2102.02080/) (2021)
- [Understanding Social Media Cross-Modality Discourse in Linguistic Space](https://mlsanity.com/paper/2302.13311/) (2023)
- [Dependency Parsing with Bottom-up Hierarchical Pointer Networks](https://mlsanity.com/paper/2105.09611/) (2021)
- [Early stopping by correlating online indicators in neural networks](https://mlsanity.com/paper/2402.02513/) (2024)
- [Absolute convergence and error thresholds in non-active adaptive sampling](https://mlsanity.com/paper/2402.02522/) (2024)
- [Modeling Unified Semantic Discourse Structure for High-quality Headline Generation](https://mlsanity.com/paper/2403.15776/) (2024)

## Abstract (arXiv)

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.
