The Fine Line between Linguistic Generalization and Failure in Seq2Seq-Attention Models

Aspects of the Theory of Syntax

Noam Chomsky. 1965 · 1965

Earlier work this paper cites.

A theory of the learnable

L. G. Valiant. 1984 · 1984

Earlier work this paper cites.

Distributed representations, simple recurrent networks, and grammatical structure

Jeffrey L Elman. 1991 · 1991

Earlier work this paper cites.

Learning to count without a counter: A case study of dynamics and activation landscapes in recurrent networks

Janet Wiles and Jeff Elman. 1995 · 1995

Earlier work this paper cites.

Long short-term memory

Sepp Hochreiter and Jürgen Schmidhuber. 1997 · 1997

Earlier work this paper cites.

Recurrent neural networks can learn to implement symbol-sensitive counting

Paul Rodriguez and Janet Wiles. 1998 · 1998

Earlier work this paper cites.

Lstm recurrent networks learn simple context-free and context-sensitive languages

F. A. Gers and E. Schmidhuber. 2001 · 2001

Earlier work this paper cites.

Effective approaches to attention-based neural machine translation

Thang Luong, Hieu Pham, and Christopher D. Manning. 2015 · 2015

Cited alongside, same era.

Neural versus phrase-based machine translation quality: a case study

Luisa Bentivogli, Arianna Bisazza, Mauro Cettolo, and Marcello Federico. 2016 · 2016

Cited alongside, same era.

Assessing the ability of lstms to learn syntax-sensitive dependencies

Tal Linzen, Emmanuel Dupoux, and Yoav Goldberg. 2016 · 2016

Cited alongside, same era.

What do neural machine translation models learn about morphology?

Yonatan Belinkov, Nadir Durrani, Fahim Dalvi, Hassan Sajjad, and James Glass. 2017 · 2017

Cited alongside, same era.

Using deep neural networks to learn syntactic agreement

Jean-Philippe Bernardy and Shalom Lappin. 2017 · 2017

Cited alongside, same era.

Towards linguistically generalizable nlp systems: A workshop and shared task

Synthetic and natural noise both break neural machine translation

Yonatan Belinkov and Yonatan Bisk. 2018 · 2018

Closest in time.

Colorless green recurrent networks dream hierarchically

Kristina Gulordava, Piotr Bojanowski, Edouard Grave, Tal Linzen, and Marco Baroni. 2018 · 2018

Closest in time.

Still not systematic after all these years: On the compositional skills of sequence-to-sequence recurrent networks

Brenden Lake and Marco Baroni. 2018 · 2018

Closest in time.

Memorize or generalize? searching for a compositional rnn in a haystack

Adam Liska, German Kruszewski, and Marco Baroni. 2018 · 2018

Closest in time.

Revisiting the poverty of the stimulus: hierarchical generalization without a hierarchical bias in recurrent neural networks

Original

R. Thomas McCoy, Robert Frank, and Tal Linzen. 2018 · 2018

Closest in time.