Fetching the paper…
Reading the bibliography…
In this paper, we systematically assess the ability of standard recurrent networks to perform dynamic counting and to encode hierarchical representations.
Recognizing well-parenthesized expressions in the streaming model
Frédéric Magniez, Claire Mathieu, and Ashwin Nayak. 2014 · 1905
Earlier work this paper cites.
The algebraic theory of context-free languages
Noam Chomsky and Marcel P Schützenberger. 1963 · 1963
Earlier work this paper cites.
Finite-turn pushdown automata
Seymour Ginsburg and Edwin H Spanier. 1966 · 1966
Earlier work this paper cites.
Computation: Finite and Infinite Machines
Marvin Lee Minsky. 1967 · 1967
Earlier work this paper cites.
Counter machines and counter languages
Patrick C Fischer, Albert R Meyer, and Arnold L Rosenberg. 1968 · 1968
Earlier work this paper cites.
Decision Procedures for Families of Deterministic Pushdown Automata
Leslie Valiant. 1973 · 1973
Earlier work this paper cites.
The equivalence problem for deterministic finite-turn pushdown automata
Leslie G Valiant. 1974 · 1974
Earlier work this paper cites.
Regularity and related problems for deterministic pushdown automata
Leslie G Valiant. 1975 · 1975
Earlier work this paper cites.
Deterministic one-counter automata
Leslie G Valiant and Michael S Paterson. 1975 · 1975
Earlier work this paper cites.
Finding structure in time
Jeffrey L Elman. 1990 · 1990
Earlier work this paper cites.
Learning context-free grammars: Capabilities and limitations of a recurrent neural network with an external stack memory
Sreerupa Das, C Lee Giles, and Guo-Zheng Sun. 1992 · 1992
Earlier work this paper cites.
On the computational power of neural nets
Hava T Siegelmann and Eduardo D Sontag. 1995 · 1995
Earlier work this paper cites.
A recurrent network that performs a context-sensitive prediction task
Mark Steijvers. 1996 · 1996
Earlier work this paper cites.
Long Short-Term Memory
Sepp Hochreiter and Jürgen Schmidhuber. 1997 · 1997
Cited alongside, same era.
Learning a context-free task with a recurrent neural network: An analysis of stability
Bradley Tonkes and Janet Wiles. 1997 · 1997
Cited alongside, same era.
The vanishing gradient problem during learning recurrent neural nets and problem solutions
Sepp Hochreiter. 1998 · 1998
Cited alongside, same era.
Recurrent neural networks can learn to implement symbol-sensitive counting
Paul Rodriguez and Janet Wiles. 1998 · 1998
Cited alongside, same era.
Learning to predict a context-free language: Analysis of dynamics in recurrent hidden units
Mikael Bodén, Janet Wiles, Bradley Tonkes, and Alan Blair. 1999 · 1999
Cited alongside, same era.
Context-free and context-sensitive dynamics in recurrent neural networks
Mikael Bodén and Janet Wiles. 2000 · 2000
Inferring algorithmic patterns with stack-augmented recurrent nets
Armand Joulin and Tomas Mikolov. 2015 · 2015
Later among the works it cites.
Learning operations on a stack with Neural Turing Machines
Tristan Deleu and Joseph Dureau. 2016 · 2016
Later among the works it cites.
Why neural translations are the right length
Xing Shi, Kevin Knight, and Deniz Yuret. 2016 · 2016
Later among the works it cites.
Can recurrent neural networks learn nested recursion?
Jean-Philippe Bernardy. 2018 · 2018
Later among the works it cites.
Context-free transductions with neural stacks
Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, and Simon Mendelsohn. 2018 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
LSTM recurrent networks learn simple context-free and context-sensitive languages
Felix A Gers and E Schmidhuber. 2001 · 2001
Cited alongside, same era.
Recurrent neural network based language model
Tomáš Mikolov, Martin Karafiát, Lukáš Burget, Jan Černockỳ, and Sanjeev Khudanpur. 2010 · 2010
Cited alongside, same era.
Learning phrase representations using RNN encoder-decoder for statistical machine translation
Kyunghyun Cho, Bart Van Merriënboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014 · 2014
Cited alongside, same era.
Alex Graves, Greg Wayne, and Ivo Danihelka. 2014 · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba. 2014 · 2014
Cited alongside, same era.
Learning to transduce with unbounded memory
Edward Grefenstette, Karl Moritz Hermann, Mustafa Suleyman, and Phil Blunsom. 2015 · 2015
Cited alongside, same era.
Luzi Sennhauser and Robert Berwick. 2018 · 2018
Later among the works it cites.
Closing brackets with recurrent neural networks
Natalia Skachkova, Thomas Trost, and Dietrich Klakow. 2018 · 2018
Later among the works it cites.
On the practical computational power of finite precision RNNs for language recognition
Gail Weiss, Yoav Goldberg, and Eran Yahav. 2018 · 2018
Later among the works it cites.
Identifying and controlling important neurons in neural machine translation
Anthony Bau, Yonatan Belinkov, Hassan Sajjad, Nadir Durrani, Fahim Dalvi, and James Glass. 2019 · 2019
Closest in time.
What is one grain of sand in the desert? analyzing individual neurons in deep NLP models
Fahim Dalvi, Nadir Durrani, Hassan Sajjad, Yonatan Belinkov, D. Anthony Bau, and James Glass. 2019 · 2019
Closest in time.
On evaluating the generalization of LSTM models in formal languages
Mirac Suzgun, Yonatan Belinkov, and Stuart M Shieber. 2019 · 2019
Closest in time.
Simple recurrent networks learn context-free and context-sensitive languages by counting
Paul Rodriguez. 2001 · 2093
Closest in time.