The Return of Lexical Dependencies: Neural Lexicalized PCFGs
In this paper we demonstrate that $\textit{context free grammar (CFG) based methods for grammar induction benefit from modeling lexical dependencies}$. This contrasts to the most popular current methods for grammar induction, which focus on discovering $\textit{either}$ constituents $\textit{or}$ dependencies. Previous approaches to marry these two disparate syntactic formalisms (e.g. lexicalized PCFGs) have been plagued by sparsity, making them unsuitable for unsupervised grammar induction. However, in this work, we present novel neural models of lexicalized PCFGs which allow us to overcome sparsity problems and effectively induce both constituents and dependencies within a single model. Experiments demonstrate that this unified framework results in stronger results on both representations than achieved when modeling either formalism alone. Code is available at https://github.com/neulab/neural-lpcfg.
Code (3)
Similar Papers 제목 키워드 기반
Neural Bi-Lexicalized PCFG Induction
Neural lexicalized PCFGs (L-PCFGs) have been shown effective in grammar induction. However, to reduce computational complexity, they make a strong independence assumption on the generation of the child word and thus bile…
Constituency Grammar InductionALP: Data Augmentation using Lexicalized PCFGs for Few-Shot Text Classification
Data augmentation has been an important ingredient for boosting performances of learned models. Prior data augmentation methods for few-shot text classification have led to great performance boosts. However, they have no…
ClassificationData AugmentationFew-Shot Text ClassificationSemi-Supervised Text Classification+3A Formal Model for Plausible Dependencies in Lexicalized Tree Adjoining Grammar
Delexicalized Word Embeddings for Cross-lingual Dependency Parsing
This paper presents a new approach to the problem of cross-lingual dependency parsing, aiming at leveraging training data from different source languages to learn a parser in a target language. Specifically, this approac…
Cross-Lingual TransferDependency ParsingWord EmbeddingsUnlexicalized Transition-based Discontinuous Constituency Parsing
Lexicalized parsing models are based on the assumptions that (i) constituents are organized around a lexical head (ii) bilexical statistics are crucial to solve ambiguities. In this paper, we introduce an unlexicalized t…
Constituency Parsing