SOTAVerified

Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Auto-Encoders

2019-06-01NAACL 2019Code Available0· sign in to hype

Andrew Drozdov, Patrick Verga, Mohit Yadav, Mohit Iyyer, Andrew McCallum

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We introduce the deep inside-outside recursive autoencoder (DIORA), a fully-unsupervised method for discovering syntax that simultaneously learns representations for constituents within the induced tree. Our approach predicts each word in an input sentence conditioned on the rest of the sentence. During training we use dynamic programming to consider all possible binary trees over the sentence, and for inference we use the CKY algorithm to extract the highest scoring parse. DIORA outperforms previously reported results for unsupervised binary constituency parsing on the benchmark WSJ dataset.

Tasks

Reproductions