Browse State-of-the-Art › Unsupervised Dependency Parsing
Unsupervised Dependency Parsing
5 papers with code · 1 benchmark · 1 dataset archive 2025-07-28
Unsupervised dependency parsing is the task of inferring the dependency parse of sentences without any labeled training data.
Description from NLP Progress
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| Penn Treebank (6 rows) | Ensemble (selected w/ society entropy) | Error Diversity Matters: An Error-Resistant Ensemble Method for... | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
1 dataset whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 24 · with a code link: 5 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 24 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 24 of 24, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
1 Dec 2020 2 repositories listedThere are two major classes of natural language grammar -- the dependency grammar that models one-to-one correspondences between words and the constituency grammar that models the assembly of one or several corresponded…
-
16 Dec 2024 1 repository listedWe address unsupervised dependency parsing by building an ensemble of diverse existing models through post hoc aggregation of their output dependency parse structures.
-
1 May 2022 1 repository listedWe introduce a new model, the Unsupervised Dependency Graph Network (UDGN), that can induce dependency structures from raw corpora and the masked language modeling task.
-
28 Aug 2018 1 repository listedIn this work, we propose a novel generative model that jointly learns discrete syntactic structure and continuous word representations in an unsupervised fashion by cascading an invertible neural network with a…
-
3 Aug 2017 1 repository listedThe encoder part of our model is discriminative and globally normalized which allows us to use rich features as well as universal linguistic priors.
-
Unsupervised Dependency Graph Network16 Nov 2021 0 repositories listedRecent work has identified properties of pretrained self-attention models that mirror those of dependency parse structures.
-
A Survey of Unsupervised Dependency Parsing4 Oct 2020 0 repositories listedSyntactic dependency parsing is an important task in natural language processing.
-
1 Jul 2019 0 repositories listedMost of the unsupervised dependency parsers are based on probabilistic generative models that learn the joint distribution of the given sentence and its parse.
-
Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition2 Aug 2017 0 repositories listedUnsupervised dependency parsing aims to learn a dependency parser from unannotated sentences.
-
Cross-lingual Transfer for Unsupervised Dependency Parsing Without Parallel Data1 Jul 2015 0 repositories listed
-
18 Apr 2015 0 repositories listedWe present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms.
-
Unsupervised Dependency Parsing with Transferring Distribution via Parallel Guidance and Entropy Regularization1 Jun 2014 0 repositories listed
-
1 Oct 2013 0 repositories listed
-
Stop-probability estimates computed on a large corpus improve Unsupervised Dependency Parsing1 Aug 2013 0 repositories listed
-
Unsupervised Dependency Parsing with Acoustic Cues1 Jan 2013 0 repositories listedUnsupervised parsing is a difficult task that infants readily perform.
-
Exploiting Reducibility in Unsupervised Dependency Parsing1 Jul 2012 0 repositories listed
-
Concavity and Initialization for Unsupervised Dependency Parsing1 Jun 2012 0 repositories listed
-
Turning the pipeline into a loop: Iterated unsupervised dependency parsing and PoS induction1 Jun 2012 0 repositories listed
-
Two baselines for unsupervised dependency parsing1 Jun 2012 0 repositories listed
-
Unsupervised Dependency Parsing using Reducibility and Fertility features1 Jun 2012 0 repositories listed
-
Fast Unsupervised Dependency Parsing with Arc-Standard Transitions1 Apr 2012 0 repositories listed
-
1 Oct 2010 0 repositories listedInducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics.
-
1 Jun 2009 0 repositories listedWe present a family of priors over probabilistic grammar weights, called the shared logistic normal distribution.
-
1 Jul 2004 0 repositories listedWe present a generative model for the unsupervised learning of dependency structures.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections