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

DOI10.1162/089976602320263980zbMath1010.68857DBLPjournals/neco/SchmidhuberGE02OpenAlexW2154039517WikidataQ52011065 ScholiaQ52011065MaRDI QIDQ3149504

Douglas Eck, Felix Gers, Jürgen Schmidhuber

Publication date: 13 May 2003

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/089976602320263980

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computing methodologies and applications (68U99)

Related Items (6)

Hierarchical linear dynamical systems for unsupervised musical note recognition ⋮ A model for learning to segment temporal sequences, utilizing a mixture of RNN experts together with adaptive variance ⋮ Training Recurrent Networks by Evolino ⋮ Learning to imitate stochastic time series in a compositional way by chaos ⋮ Stack-like and queue-like dynamics in recurrent neural networks ⋮ LSTM

Cites Work

• Simple Recurrent Networks Learn Context-Free and Context-Sensitive Languages by Counting

This page was built for publication: Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM