Ryan Cotterell, Tim Vieira, Ran Zmigrod
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.
The connection between dependency trees and spanning trees is exploited by the NLP community to train and to decode graph-based dependency parsers. However, the NLP literature has missed an important difference between the two structures: only one edge may emanate from the root in a dependency tree. We analyzed the output of state-of-the-art parsers on many languages from the Universal Dependency Treebank: although these parsers are often able to learn that trees which violate the constraint should be assigned lower probabilities, their ability to do so unsurprisingly degrades as the size of the training set decreases. In fact, the worst constraint-violation rate we observe is 24%. Prior work has proposed an inefficient algorithm to enforce the constraint, which adds a factor of n to the decoding runtime. We adapt an algorithm due to Gabow and Tarjan (1984) to dependency parsing, which satisfies the constraint without compromising the original runtime. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2010.02550")
get_code_for_paper("2010.02550")
have("2010.02550")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2010.02550.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2010.02550)
Connect an agent — have() is free.