Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Schmidhuber, J.
Right arrow Articles by Eck, D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Schmidhuber, J.
Right arrow Articles by Eck, D.
(Neural Computation. 2002;14:2039-2041.)
© 2002 The MIT Press

Note

Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM

J. Schmidhuber

juergen{at}idsia.ch, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, 6928 Manno-Lugano, Switzerland

F. Gers

felix{at}idsia.ch, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, 6928 Manno-Lugano, Switzerland

D. Eck

doug{at}idsia.ch, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, 6928 Manno-Lugano, Switzerland

In response to Rodriguez's recent article (2001), we compare the performance of simple recurrent nets and long short-term memory recurrent nets on context-free and context-sensitive languages.




This article has been cited by other articles:


Home page
 Neural Comput.Home page
J. Schmidhuber, D. Wierstra, M. Gagliolo, and F. Gomez
Training recurrent networks by evolino.
Neural Comput., March 1, 2007; 19(3): 757 - 779.
[Abstract] [Full Text] [PDF]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2002 by The MIT Press.