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 two first-order graph-based dependency parsers achieving a new state of the art. The first is a consensus parser built from an ensemble of independently trained greedy LSTM transition-based parsers with different random initializations. We cast this approach as minimum Bayes risk decoding (under the Hamming cost) and argue that weaker consensus within the ensemble is a useful signal of difficulty or ambiguity. The second parser is a "distillation" of the ensemble into a single model. We train the distillation parser using a structured hinge loss objective with a novel cost that incorporates ensemble uncertainty estimates for each possible attachment, thereby avoiding the intractable cross-entropy computations required by applying standard distillation objectives to problems with structured outputs. The first-order distillation parser matches or surpasses the state of the art on English, Chinese, and German.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1609.07561")
get_code_for_paper("1609.07561")
have("1609.07561")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1609.07561.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1609.07561)
Connect an agent — have() is free.