Context-Free Transductions with Neural Stacks
Not on the map. Why?
Abstract (arXiv)
This paper analyzes the behavior of stack-augmented recurrent neural network (RNN) models. Due to the architectural similarity between stack RNNs and pushdown transducers, we train stack RNN models on a number of tasks, including string reversal, context-free language modelling, and cumulative XOR evaluation. Examining the behavior of our networks, we show that stack-augmented RNNs can discover intuitive stack-based strategies for solving our tasks. However, stack RNNs are more difficult to train than classical architectures such as LSTMs. Rather than employ stack-based strategies, more complex networks often find approximate solutions by using the stack as unstructured memory.
Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 2; 2024: 7.
14 papers.
Sort:
- 2022Neural Networks and the Chomsky Hierarchycited by 217
- 2024Mission: Impossible Language Modelscited by 32
- 2024Transformers Can Represent n-gram Language Modelscited by 32
- 2024What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languagescited by 20
- 2021Learning Hierarchical Structures with Differentiable Nondeterministic Stackscited by 16
- 2021Formal Language Theory Meets Modern NLPcited by 9
- 2021Learning Bounded Context-Free-Grammar via LSTM and the Transformer:Difference and Explanationscited by 7
- 2023Recurrent Neural Language Models as Probabilistic Finite-state Automatacited by 6
- 2024Lower Bounds on the Expressivity of Recurrent Neural Language Modelscited by 4
- 2022State-Regularized Recurrent Neural Networks to Extract Automata and Explain Predictionscited by 2
- 2024A Transformer with Stack Attentioncited by 2
- 2023On the Representational Capacity of Recurrent Neural Language Modelscited by 1
- 2024What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languages6 Jun 2024
- 2024Lower Bounds on the Expressivity of Recurrent Neural Language Models29 May 2024
- 2024A Transformer with Stack Attention7 May 2024
- 2024Transformers Can Represent n-gram Language Models23 Apr 2024
- 2024Enhancing Length Extrapolation in Sequential Models with Pointer-Augmented Neural Memory18 Apr 2024
- 2024On Efficiently Representing Regular Languages as RNNs24 Feb 2024
- 2024Mission: Impossible Language Models12 Jan 2024
- 2023On the Representational Capacity of Recurrent Neural Language Models19 Oct 2023
- 2023Recurrent Neural Language Models as Probabilistic Finite-state Automata8 Oct 2023
- 2022State-Regularized Recurrent Neural Networks to Extract Automata and Explain Predictions10 Dec 2022
- 2022Neural Networks and the Chomsky Hierarchy5 Jul 2022
- 2021Learning Bounded Context-Free-Grammar via LSTM and the Transformer:Difference and Explanations16 Dec 2021
2 more
- 2021Learning Hierarchical Structures with Differentiable Nondeterministic Stacks5 Sep 2021
- 2021Formal Language Theory Meets Modern NLP19 Feb 2021
- 2022Neural Networks and the Chomsky Hierarchycited by 217
- 2024Mission: Impossible Language Modelscited by 32
- 2024Transformers Can Represent n-gram Language Modelscited by 32
- 2024What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languagescited by 20
- 2021Learning Hierarchical Structures with Differentiable Nondeterministic Stackscited by 16
- 2021Formal Language Theory Meets Modern NLPcited by 9
- 2021Learning Bounded Context-Free-Grammar via LSTM and the Transformer:Difference and Explanationscited by 7
- 2023Recurrent Neural Language Models as Probabilistic Finite-state Automatacited by 6
- 2024Lower Bounds on the Expressivity of Recurrent Neural Language Modelscited by 4
- 2022State-Regularized Recurrent Neural Networks to Extract Automata and Explain Predictionscited by 2
- 2024A Transformer with Stack Attentioncited by 2
- 2023On the Representational Capacity of Recurrent Neural Language Modelscited by 1
12 most cited of 14 All 14 (JSON)
- 2024What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languages6 Jun 2024
- 2024Lower Bounds on the Expressivity of Recurrent Neural Language Models29 May 2024
- 2024A Transformer with Stack Attention7 May 2024
- 2024Transformers Can Represent n-gram Language Models23 Apr 2024
- 2024Enhancing Length Extrapolation in Sequential Models with Pointer-Augmented Neural Memory18 Apr 2024
- 2024On Efficiently Representing Regular Languages as RNNs24 Feb 2024
- 2024Mission: Impossible Language Models12 Jan 2024
- 2023On the Representational Capacity of Recurrent Neural Language Models19 Oct 2023
- 2023Recurrent Neural Language Models as Probabilistic Finite-state Automata8 Oct 2023
- 2022State-Regularized Recurrent Neural Networks to Extract Automata and Explain Predictions10 Dec 2022
- 2022Neural Networks and the Chomsky Hierarchy5 Jul 2022
- 2021Learning Bounded Context-Free-Grammar via LSTM and the Transformer:Difference and Explanations16 Dec 2021
12 newest of 14 All 14 (JSON)