Abstract
We are proposing an extension of the recursive neural network that makes use of a variant of the long short-term memory architecture. The extension allows information low in parse trees to be stored in a memory register (the ‘memory cell’) and used much later higher up in the parse tree. This provides a solution to the vanishing gradient problem and allows the network to capture long range dependencies. Experimental results show that our composition outperformed the traditional neural-network composition on the Stanford Sentiment Treebank.
Original language | English |
---|---|
Title of host publication | Proceedings of the Fourth Joint Conference on Lexical and Computational Semantics |
Place of Publication | Denver, Colorado |
Publisher | Association for Computational Linguistics |
Pages | 10-19 |
Number of pages | 10 |
DOIs | |
Publication status | Published - Jun 2015 |
Event | Fourth Joint Conference on Lexical and Computational Semantics - Denver, United States Duration: 4 Jun 2015 → 5 Jun 2015 https://sites.google.com/site/starsem2015/ |
Conference
Conference | Fourth Joint Conference on Lexical and Computational Semantics |
---|---|
Abbreviated title | SEM 2015 |
Country/Territory | United States |
City | Denver |
Period | 4/06/15 → 5/06/15 |
Internet address |