Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rule Augmented Unsupervised Constituency Parsing (2105.10193v1)

Published 21 May 2021 in cs.CL and cs.LG

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. The source code of the paper is available at https://github.com/anshuln/Diora_with_rules.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Atul Sahay (4 papers)
  2. Anshul Nasery (12 papers)
  3. Ayush Maheshwari (19 papers)
  4. Ganesh Ramakrishnan (88 papers)
  5. Rishabh Iyer (70 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.