Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2011.03965
Cited By
On the Practical Ability of Recurrent Neural Networks to Recognize Hierarchical Languages
8 November 2020
S. Bhattamishra
Kabir Ahuja
Navin Goyal
ReLM
Re-assign community
ArXiv
PDF
HTML
Papers citing
"On the Practical Ability of Recurrent Neural Networks to Recognize Hierarchical Languages"
6 / 6 papers shown
Title
Training Neural Networks as Recognizers of Formal Languages
Alexandra Butoi
Ghazal Khalighinejad
Anej Svete
Josef Valvoda
Ryan Cotterell
Brian DuSell
NAI
44
2
0
11 Nov 2024
Separations in the Representational Capabilities of Transformers and Recurrent Architectures
S. Bhattamishra
Michael Hahn
Phil Blunsom
Varun Kanade
GNN
44
9
0
13 Jun 2024
Recurrent Neural Language Models as Probabilistic Finite-state Automata
Anej Svete
Ryan Cotterell
42
2
0
08 Oct 2023
Faith and Fate: Limits of Transformers on Compositionality
Nouha Dziri
Ximing Lu
Melanie Sclar
Xiang Lorraine Li
Liwei Jian
...
Sean Welleck
Xiang Ren
Allyson Ettinger
Zaïd Harchaoui
Yejin Choi
ReLM
LRM
37
336
0
29 May 2023
Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions
S. Bhattamishra
Arkil Patel
Varun Kanade
Phil Blunsom
22
46
0
22 Nov 2022
Benchmarking Compositionality with Formal Languages
Josef Valvoda
Naomi Saphra
Jonathan Rawski
Adina Williams
Ryan Cotterell
NAI
CoGe
38
9
0
17 Aug 2022
1