SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1504.04666 · 2015

Unsupervised Dependency Parsing: Let's Use Supervised Parsers

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.

Abstract

We present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms. Our approach, called `iterated reranking' (IR), starts with dependency trees generated by an unsupervised parser, and iteratively improves these trees using the richer probability models used in supervised parsing that are in turn trained on these trees. Our system achieves 1.8% accuracy higher than the state-of-the-part parser of Spitkovsky et al. (2013) on the WSJ corpus.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1504.04666")
get_code_for_paper("1504.04666")
have("1504.04666")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1504.04666.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1504.04666.svg)](https://syntology.ai/paper/1504.04666)

Connect an agent — have() is free.