Ryan Cotterell, Afra Amini, Tianyu Liu
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.
We introduce a novel dependency parser, the hexatagger, that constructs dependency trees by tagging the words in a sentence with elements from a finite set of possible tags. In contrast to many approaches to dependency parsing, our approach is fully parallelizable at training time, i.e., the structure-building actions needed to build a dependency parse can be predicted in parallel to each other. Additionally, exact decoding is linear in time and space complexity. Furthermore, we derive a probabilistic dependency parser that predicts hexatags using no more than a linear model with features from a pretrained language model, i.e., we forsake a bespoke architecture explicitly designed for the task. Despite the generality and simplicity of our approach, we achieve state-of-the-art performance of 96.4 LAS and 97.4 UAS on the Penn Treebank test set. Additionally, our parser's linear time complexity and parallelism significantly improve computational efficiency, with a roughly 10-times speed-up over previous state-of-the-art models during decoding. https://github.com/rycolab/ parsing-as-tagging
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2306.05477")
get_code_for_paper("2306.05477")
have("2306.05477")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2306.05477.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2306.05477)
Connect an agent — have() is free.