Unsupervised Dependency Parsing: Let's Use Supervised Parsers

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.

11 pages

Cited by in corpus (5)

• StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modeling
• Unsupervised Learning of Syntactic Structure with Invertible Neural Projections
• Dependency Grammar Induction with a Neural Variational Transition-based Parser
• Dependency Grammar Induction with Neural Lexicalization and Big Training Data
• A Survey of Unsupervised Dependency Parsing