A Regularization-based Framework for Bilingual Grammar Induction
Grammar induction aims to discover syntactic structures from unannotated sentences. In this paper, we propose a framework in which the learning process of the grammar model of one language is influenced by knowledge from the model of another language. Unlike previous work on multilingual grammar induction, our approach does not rely on any external resource, such as parallel corpora, word alignments or linguistic phylogenetic trees. We propose three regularization methods that encourage similarity between model parameters, dependency edge scores, and parse trees respectively. We deploy our methods on a state-of-the-art unsupervised discriminative parser and evaluate it on both transfer grammar induction and bilingual grammar induction. Empirical results on multiple languages show that our methods outperform strong baselines.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Bilingually-Guided Monolingual Dependency Grammar Induction
Unsupervised Learning of Bilingual Categories in Inversion Transduction Grammar Induction
From Finite-State to Inversion Transductions: Toward Unsupervised Bilingual Grammar Induction
Shared Logistic Normal Distributions for Soft Parameter Tying in Unsupervised Grammar Induction
We present a family of priors over probabilistic grammar weights, called the shared logistic normal distribution. This family extends the partitioned logistic normal distribution, enabling factored covariance between the…
Dependency Grammar InductionUnsupervised Dependency ParsingDuality Regularization for Unsupervised Bilingual Lexicon Induction
Unsupervised bilingual lexicon induction naturally exhibits duality, which results from symmetry in back-translation. For example, EN-IT and IT-EN induction can be mutually primal and dual problems. Current state-of-the-…
Bilingual Lexicon InductionTranslation