Carlos Gómez-Rodríguez, Daniel Fernández-González
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.
Sequence-to-sequence constituent parsing requires a linearization to represent trees as sequences. Top-down tree linearizations, which can be based on brackets or shift-reduce actions, have achieved the best accuracy to date. In this paper, we show that these results can be improved by using an inorder linearization instead. Based on this observation, we implement an enriched inorder shift-reduce linearization inspired by Vinyals et al. ( 2015)'s approach, achieving the best accuracy to date on the English PTB dataset among fully-supervised single-model sequence-to-sequence constituent parsers. Finally, we apply deterministic attention mechanisms to match the speed of state-of-theart transition-based parsers, thus showing that sequence-to-sequence models can match them, not only in accuracy, but also in speed.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.13334")
get_code_for_paper("2005.13334")
have("2005.13334")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.13334.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.13334)
Connect an agent — have() is free.