CRF Autoencoder for Unsupervised Dependency Parsing
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.
Code (1)
Tasks
Dependency Grammar InductionUnsupervised Dependency ParsingSimilar Papers 제목 키워드 기반
Adapting Unsupervised Syntactic Parsing Methodology for Discourse Dependency Parsing
One of the main bottlenecks in developing discourse dependency parsers is the lack of annotated training data. A potential solution is to utilize abundant unlabeled data by using unsupervised techniques, but there is so …
Dependency ParsingDiscourse ParsingA Survey of Unsupervised Dependency Parsing
Syntactic dependency parsing is an important task in natural language processing. Unsupervised dependency parsing aims to learn a dependency parser from sentences that have no annotation of their correct parse trees. Des…
Dependency ParsingSurveyUnsupervised Dependency ParsingUnsupervised Dependency Parsing: Let's Use Supervised Parsers
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 gen…
Dependency ParsingRerankingUnsupervised Dependency ParsingStructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modeling
There 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 …
Constituency ParsingDependency ParsingLanguage ModelingLanguage Modelling+2Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders
Semantic dependency parsing, which aims to find rich bi-lexical relationships, allows words to have multiple dependency heads, resulting in graph-structured representations. We propose an approach to semi-supervised lear…
ARCDecoderDependency ParsingSemantic Dependency Parsing+1