We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce three memory-augmented Recurrent Neural Networks (MARNNs) and explore their capabilities on a series of simple language modeling tasks whose solutions require stack-based mechanisms. We provide the first demonstration of neural networks recognizing the generalized Dyck languages, which express the core of what it means to be a language with hierarchical structure. Our memory-augmented architectures are easy to train in an end-to-end fashion and can learn the Dyck languages over as many as six parenthesis-pairs, in addition to two deterministic palindrome languages and the string-reversal transduction task, by emulating pushdown automata. Our experiments highlight the increased modeling capacity of memory-augmented models over simple RNNs, while inflecting our understanding of the limitations of these models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1911.03329")
get_code_for_paper("1911.03329")
have("1911.03329")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1911.03329.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1911.03329)
Connect an agent — have() is free.