paper-with-me

홈 › Papers

Enhancing Unsupervised Generative Dependency Parser with Contextual Information

2019-07-01 · ACL 2019 7 · Wenjuan Han, Yong Jiang, Kewei Tu

Most of the unsupervised dependency parsers are based on probabilistic generative models that learn the joint distribution of the given sentence and its parse. Probabilistic generative models usually explicit decompose the desired dependency tree into factorized grammar rules, which lack the global features of the entire sentence. In this paper, we propose a novel probabilistic model called discriminative neural dependency model with valence (D-NDMV) that generates a sentence and its parse from a continuous latent representation, which encodes global contextual information of the generated sentence. We propose two approaches to model the latent representation: the first deterministically summarizes the representation from the sentence and the second probabilistically models the representation conditioned on the sentence. Our approach can be regarded as a new type of autoencoder model to unsupervised dependency parsing that combines the benefits of both generative and discriminative techniques. In particular, our approach breaks the context-free independence assumption in previous generative approaches and therefore becomes more expressive. Our extensive experimental results on seventeen datasets from various sources show that our approach achieves competitive accuracy compared with both generative and discriminative state-of-the-art unsupervised dependency parsers.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Constituency Grammar InductionDependency Grammar InductionSentenceUnsupervised Dependency Parsing

Methods 이 논문이 사용한 방법론

Solana Customer Service Number +1-833-534-1729 설명 없음

Similar Papers 제목 키워드 기반

Unsupervised Cross-Lingual Adaptation of Dependency Parsers Using CRF Autoencoders

2020-11-01 · Findings of the Association for Computational Linguistics 2020 · Zhao Li, Kewei Tu

We consider the task of cross-lingual adaptation of dependency parsers without annotated target corpora and parallel corpora. Previous work either directly applies a discriminative source parser to the target language, i…

Unsupervised Dependency Parsing: Let's Use Supervised Parsers

2015-04-18 · HLT 2015 5 · Phong Le, Willem Zuidema

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 Parsing

Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition

2017-08-02 · EMNLP 2017 9 · Yong Jiang, Wenjuan Han, Kewei Tu

Unsupervised dependency parsing aims to learn a dependency parser from unannotated sentences. Existing work focuses on either learning generative models using the expectation-maximization algorithm and its variants, or l…

ClusteringDependency Grammar InductionUnsupervised Dependency Parsing

Second-Order Unsupervised Neural Dependency Parsing

2020-10-28 · COLING 2020 8 · Songlin Yang, Yong Jiang, Wenjuan Han, Kewei Tu

Most of the unsupervised dependency parsers are based on first-order probabilistic generative models that only consider local parent-child information. Inspired by second-order supervised dependency parsing, we proposed …

Dependency Grammar InductionDependency Parsing

Fill it up: Exploiting partial dependency annotations in a minimum spanning tree parser

2016-11-26 · Liang Sun, Jason Mielens, Jason Baldridge

Unsupervised models of dependency parsing typically require large amounts of clean, unlabeled data plus gold-standard part-of-speech tags. Adding indirect supervision (e.g. language universals and rules) can help, but we…

Dependency Parsing