We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1908.11571")
get_code_for_paper("1908.11571")
have("1908.11571")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1908.11571.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1908.11571)
Connect an agent — have() is free.