CRF Autoencoder for Unsupervised Dependency Parsing

On shortest arborescence of a directed graph

Yoeng-Jin Chu and Tseng-Hong Liu. 1965 · 1965

Earlier work this paper cites.

Optimum branchings

Jack Edmonds. 1967 · 1967

Earlier work this paper cites.

Finding optimum branchings

Robert Endre Tarjan. 1977 · 1977

Earlier work this paper cites.

Breaking out of local optima with count transforms and model recombination: A study in grammar induction

Valentin I Spitkovsky, Hiyan Alshawi, and Daniel Jurafsky. 2013 · 1995

Earlier work this paper cites.

Three new probabilistic models for dependency parsing: An exploration

Jason M Eisner. 1996 · 1996

Earlier work this paper cites.

Cubic-time parsing and learning algorithms for grammatical bigram models

Mark A Paskin. 2001 · 2001

Earlier work this paper cites.

Corpus-based induction of syntactic structure: Models of dependency and constituency

Dan Klein and Christopher D Manning. 2004 · 2004

Earlier work this paper cites.

Online large-margin training of dependency parsers

Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005 · 2005

Cited alongside, same era.

Structured prediction models via the matrix-tree theorem

Terry Koo, Amir Globerson, Xavier Carreras Pérez, and Michael Collins. 2007 · 2007

Cited alongside, same era.

Logistic normal priors for unsupervised probabilistic grammar induction

Shay B Cohen, Kevin Gimpel, and Noah A Smith. 2008 · 2008

Cited alongside, same era.

Painless unsupervised learning with features

Taylor Berg-Kirkpatrick, Alexandre Bouchard-Côté, John DeNero, and Dan Klein. 2010 · 2010

Cited alongside, same era.

Unsupervised induction of tree substitution grammars for dependency parsing

Phil Blunsom and Trevor Cohn. 2010 · 2010

Cited alongside, same era.

Using universal linguistic knowledge to guide grammar induction

Tahira Naseem, Harr Chen, Regina Barzilay, and Mark Johnson. 2010 · 2010

The pascal challenge on grammar induction

Douwe Gelling, Trevor Cohn, Phil Blunsom, and Joao Graça. 2012 · 2012

Later among the works it cites.

Unambiguity regularization for unsupervised learning of probabilistic grammars

Original

Kewei Tu and Vasant Honavar. 2012 · 2012

Later among the works it cites.

Conditional random field autoencoders for unsupervised structured prediction

Waleed Ammar, Chris Dyer, and Noah A Smith. 2014 · 2014

Later among the works it cites.

A convex and feature-rich discriminative approach to dependency grammar induction

Edouard Grave and Noémie Elhadad. 2015 · 2015

Later among the works it cites.

Unsupervised dependency parsing: Let’s use supervised parsers

Phong Le and Willem Zuidema. 2015 · 2015

Later among the works it cites.

Unsupervised neural dependency parsing