CRF Autoencoder for Unsupervised Dependency Parsing

Abstract

Unsupervised dependency parsing, which tries to discover linguistic dependency structures from unannotated data, is a very challenging task. Almost all previous work on this task focuses on learning generative models. In this paper, we develop an unsupervised dependency parsing model based on the CRF autoencoder. The encoder part of our model is discriminative and globally normalized which allows us to use rich features as well as universal linguistic priors. We propose an exact algorithm for parsing as well as a tractable learning algorithm. We evaluated the performance of our model on eight multilingual treebanks and found that our model achieved comparable performance with state-of-the-art approaches.

arXiv commentEMNLP 2017

Cited by in corpus (4)

• A Tutorial on Deep Latent Variable Models of Natural Language
• 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