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 dependency parsers often need sequences of local shift and reduce operations to produce certain attachments. Correct individual decisions hence require global information about the sentence context and mistakes cause error propagation. This paper proposes a novel transition system, arc-swift, that enables direct attachments between tokens farther apart with a single transition. This allows the parser to leverage lexical information more directly in transition decisions. Hence, arc-swift can achieve significantly better performance with a very small beam size. Our parsers reduce error by 3.7--7.6% relative to those using existing transition systems on the Penn Treebank dependency parsing task and English Universal Dependencies.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1705.04434")
get_code_for_paper("1705.04434")
have("1705.04434")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1705.04434.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1705.04434)
Connect an agent — have() is free.