Rule Augmented Unsupervised Constituency Parsing

3Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

Abstract

Recently, unsupervised parsing of syntactic trees has gained considerable attention. A prototypical approach to such unsupervised parsing employs reinforcement learning and auto-encoders. However, no mechanism ensures that the learnt model leverages the well-understood language grammar. We propose an approach that utilizes very generic linguistic knowledge of the language present in the form of syntactic rules, thus inducing better syntactic structures. We introduce a novel formulation that takes advantage of the syntactic grammar rules and is independent of the base system. We achieve new state-of-the-art results on two benchmarks datasets, MNLI and WSJ.

Cite

CITATION STYLE

APA

Sahay, A., Nasery, A., Maheshwari, A., Ramakrishnan, G., & Iyer, R. (2021). Rule Augmented Unsupervised Constituency Parsing. In Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021 (pp. 4923–4932). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2021.findings-acl.436

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free