Fetching the paper…
Reading the bibliography…
Recombining known primitive concepts into larger novel combinations is a quintessentially human cognitive capability.
Finite counting automata
Marcel P. Schützenberger. 1962 · 1962
Earlier work this paper cites.
Universal grammar
Richard Montague. 1970 · 1970
Earlier work this paper cites.
Connectionism and cognitive architecture: A critical analysis
Jerry A. Fodor and Zenon W. Pylyshyn. 1988 · 1988
Earlier work this paper cites.
Finite state automata and simple recurrent networks
Axel Cleeremans, David Servan-Schreiber, and James L. McClelland. 1989 · 1989
Earlier work this paper cites.
Learning subsequential transducers for pattern recognition interpretation tasks
José Oncina, Pedro García, and Enrique Vidal. 1993 · 1993
Earlier work this paper cites.
Lexical semantics and compositionality
Barbara Partee. 1995 · 1995
Earlier work this paper cites.
Long short-term memory
Sepp Hochreiter and Jürgen Schmidhuber. 1997 · 1997
Earlier work this paper cites.
Finite-state transducers in language and speech processing
Mehryar Mohri. 1997 · 1997
Earlier work this paper cites.
There are no recognitional concepts; not even red
Jerry Fodor. 1998 · 1998
Earlier work this paper cites.
Rethinking eliminative connectionism
Gary F. Marcus. 1998 · 1998
Earlier work this paper cites.
Minimizing subsequential transducers: a survey
Christian Choffrut. 2003 · 2003
Earlier work this paper cites.
Rule extraction from recurrent neural networks: A taxonomy and review
Henrik Jacobsson. 2005 · 2005
Earlier work this paper cites.
Probabilistic finite-state machines - part I
E. Vidal, F. Thollard, C. de la Higuera, F. Casacuberta, and R. C. Carrasco. 2005 · 2005
Earlier work this paper cites.
RNNs can generate bounded hierarchical languages with optimal memory
John Hewitt, Michael Hahn, Surya Ganguli, Percy Liang, and Christopher D. Manning. 2020 · 2010
Cited alongside, same era.
Grammatical Inference: Learning Automata and Grammars
Colin de la Higuera. 2010 · 2010
Cited alongside, same era.
Aural pattern recognition experiments and the subregular hierarchy
James Rogers and Geoffrey K. Pullum. 2011 · 2011
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.
Neural machine translation by jointly learning to align and translate
Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2015 · 2015
Cited alongside, same era.
Multi-element long distance dependencies: Using SPk languages to explore the characteristics of long-distance dependencies
Abhijit Mahalunkar and John Kelleher. 2019 · 2019
Later among the works it cites.
No free lunch in linguistics or machine learning: Response to pater
Jonathan Rawski and Jeffrey Heinz. 2019 · 2019
Later among the works it cites.
LSTM networks can perform dynamic counting
Mirac Suzgun, Yonatan Belinkov, Stuart Shieber, and Sebastian Gehrmann. 2019 · 2019
Later among the works it cites.
Exact hard monotonic attention for character-level transduction
Shijie Wu and Ryan Cotterell. 2019 · 2019
Later among the works it cites.
Boolean monadic recursive schemes as a logical characterization of the subsequential functions
Siddharth Bhaskar, Jane Chandlee, Adam Jardine, and Christopher Oakden. 2020 · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Diederik P. Kingma and Jimmy Ba. 2015 · 2015
Cited alongside, same era.
A roadmap towards machine intelligence
Tomas Mikolov, Armand Joulin, and Marco Baroni. 2016 · 2016
Cited alongside, same era.
Subregular complexity and deep learning
Enes Avcu, Chihiro Shibata, and Jeffrey Heinz. 2017 · 2017
Cited alongside, same era.
Results of the sequence prediction challenge (SPiCe): a competition on learning the next symbol in a sequence
Borja Balle, Rémi Eyraud, Franco M. Luque, Ariadna Quattoni, and Sicco Verwer. 2017 · 2017
Cited alongside, same era.
Jump to better conclusions: SCAN both left and right
Jasmijn Bastings, Marco Baroni, Jason Weston, Kyunghyun Cho, and Douwe Kiela. 2018 · 2018
Cited alongside, same era.
Brenden Lake and Marco Baroni. 2018 · 2018
Cited alongside, same era.
On the practical computational power of finite precision RNNs for language recognition
Gail Weiss, Yoav Goldberg, and Eran Yahav. 2018 · 2018
Cited alongside, same era.
Satwik Bhattamishra, Kabir Ahuja, and Navin Goyal. 2020 · 2020
Later among the works it cites.
Probing RNN encoder-decoder generalization of subregular functions using reduplication
Max Nelson, Hossep Dolatian, Jonathan Rawski, and Brandon Prickett. 2020 · 2020
Later among the works it cites.
A benchmark for systematic generalization in grounded language understanding
Laura Ruis, Jacob Andreas, Marco Baroni, Diane Bouchacourt, and Brenden M. Lake. 2020 · 2020
Later among the works it cites.
Examining the inductive bias of neural language models with artificial languages
Jennifer C. White and Ryan Cotterell. 2021 · 2021
Later among the works it cites.
Unobserved local structures make compositional generalization hard
Ben Bogin, Shivanshu Gupta, and Jonathan Berant. 2022 · 2022
Closest in time.
The paradox of the compositionality of natural language: A neural machine translation case study
Verna Dankers, Elia Bruni, and Dieuwke Hupkes. 2022 · 2022
Closest in time.
Equivariant transduction through invariant alignment
Jennifer C. White and Ryan Cotterell. 2022 · 2022
Closest in time.