Browse State-of-the-Art › Dependency Grammar Induction
Dependency Grammar Induction
3 papers with code · 2 benchmarks · 0 datasets archive 2025-07-28
Also known as "unsupervised dependency parsing"
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
2 leaderboard tables shown for this task, 2 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 |
|---|---|---|---|---|---|
| WSJ10 (2 rows) | Joint training: sibling-NDMV + L-NDMV * | Second-Order Unsupervised Neural Dependency Parsing | code | — | Compare |
| WSJ (1 row) | Joint training: sibling-NDMV + L-NDMV * | Second-Order Unsupervised Neural Dependency Parsing | 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
No dataset record in the archive lists this task.
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: 20 · with a code link: 3 · 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 20 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 20 of 20, 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.
-
28 Oct 2020 1 repository listedInspired by second-order supervised dependency parsing, we proposed a second-order extension of unsupervised neural dependency models that incorporate grandparent-child or sibling information.
-
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.
-
1 Nov 2016 1 repository listed
-
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.
-
Dependency Grammar Induction with a Neural Variational Transition-based Parser14 Nov 2018 0 repositories listedDependency grammar induction is the task of learning dependency syntax without annotated training data.
-
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.
-
Dependency Grammar Induction with Neural Lexicalization and Big Training Data2 Aug 2017 0 repositories listedWe study the impact of big models (in terms of the degree of lexicalization) and big data (in terms of the training corpus size) on dependency grammar induction.
-
Matroids Hitting Sets and Unsupervised Dependency Grammar Induction24 May 2017 0 repositories listedThis paper formulates a novel problem on graphs: find the minimal subset of edges in a fully connected graph, such that the resulting graph contains all spanning trees for a set of specifed sub-graphs.
-
A convex and feature-rich discriminative approach to dependency grammar induction1 Jul 2015 0 repositories listed
-
1 Oct 2013 0 repositories listed
-
Bilingually-Guided Monolingual Dependency Grammar Induction1 Aug 2013 0 repositories listed
-
A Feature-Rich Constituent Context Model for Grammar Induction1 Jul 2012 0 repositories listed
-
Three Dependency-and-Boundary Models for Grammar Induction1 Jul 2012 0 repositories listed
-
Unambiguity Regularization for Unsupervised Learning of Probabilistic Grammars1 Jul 2012 0 repositories listed
-
Capitalization Cues Improve Dependency Grammar Induction1 Jun 2012 0 repositories listed
-
Concavity and Initialization for Unsupervised Dependency Parsing1 Jun 2012 0 repositories listed
-
The PASCAL Challenge on Grammar Induction1 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.
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