Deep Learning for Efficient Discriminative Parsing
Abstract
We propose a new fast purely discriminative algorithm for natural language parsing, based on a “deep” recurrent convolutional graph transformer network (GTN). Assuming a decomposition of a parse tree into a stack of “levels”, the network predicts a level of the tree taking into account predictions of previous levels. Using only few basic text features which leverage word representations from Collobert and Weston (2008), we show similar performance (in $F_1$ score) to existing pure discriminative parsers and existing “benchmark” parsers (like Collins parser, probabilistic context-free grammars based), with a huge speed advantage.
Cite
Text
Collobert. "Deep Learning for Efficient Discriminative Parsing." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.Markdown
[Collobert. "Deep Learning for Efficient Discriminative Parsing." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.](https://mlanthology.org/aistats/2011/collobert2011aistats-deep/)BibTeX
@inproceedings{collobert2011aistats-deep,
title = {{Deep Learning for Efficient Discriminative Parsing}},
author = {Collobert, Ronan},
booktitle = {Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics},
year = {2011},
pages = {224-232},
volume = {15},
url = {https://mlanthology.org/aistats/2011/collobert2011aistats-deep/}
}