TASK	DATASET	MODEL	METRIC NAME	METRIC VALUE	GLOBAL RANK	REMOVE
Constituency Parsing	Penn Treebank	RNN Grammar	F1 score	93.3	# 25

Badge	Markdown
	`[![PWC](https://img.shields.io/endpoint.svg?url=https://paperswithcode.com/badge/recurrent-neural-network-grammars/constituency-parsing-on-penn-treebank)](https://paperswithcode.com/sota/constituency-parsing-on-penn-treebank?p=recurrent-neural-network-grammars)`

Recurrent Neural Network Grammars

NAACL 2016 · Chris Dyer, Adhiguna Kuncoro, Miguel Ballesteros, Noah A. Smith ·

We introduce recurrent neural network grammars, probabilistic models of sentences with explicit phrase structure. We explain efficient inference procedures that allow application to both parsing and language modeling. Experiments show that they provide better parsing in English than any single previously published supervised generative model and better language modeling than state-of-the-art sequential RNNs in English and Chinese.