SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2109.01982 · ICLR · 2022

Learning Hierarchical Structures with Differentiable Nondeterministic Stacks

David Chiang, Brian Dusell

arXiv · PDF · Open in the Atlas

Code that ran

3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 3 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 0 failures of our instrument; 0 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2109.01982.json · badge: /api/ran/2109.01982.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
bdusell/nondeterministic-stack-rnn canonical (classifier label)
classifier basis: classifier_2025
3 ran · 0 no recorded run
FunctionStatusWhere it lives
ensure_not_negative Ran
ran, honoured the contract we drafted
bdusell/nondeterministic-stack-rnn/src/stack_rnn_models/nondeterministic_stack.py
pointer only (licence: NONE) · get_code("64a2db52cb99b8d7")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, bdusell/nondeterministic-stack-rnn when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

alpha_j_index Ran
ran, honoured the contract we drafted
bdusell/nondeterministic-stack-rnn/src/stack_rnn_models/nondeterministic_stack.py
pointer only (licence: NONE) · get_code("cd507999d35f69ca")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, bdusell/nondeterministic-stack-rnn when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

gamma_i_index Ran
ran, honoured the contract we drafted
bdusell/nondeterministic-stack-rnn/src/stack_rnn_models/nondeterministic_stack.py
pointer only (licence: NONE) · get_code("d17f9b2a1bbe7c9a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, bdusell/nondeterministic-stack-rnn when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 0 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
alpha_j_index 1 other paper
1 dated earlier
2010.04674 (2020-10)
Learning Context-Free Languages with Nondeterministic Stack RNNs
ensure_not_negative 1 other paper
1 dated earlier
2010.04674 (2020-10)
Learning Context-Free Languages with Nondeterministic Stack RNNs
gamma_i_index 1 other paper
1 dated earlier
2010.04674 (2020-10)
Learning Context-Free Languages with Nondeterministic Stack RNNs

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Learning hierarchical structures in sequential data-from simple algorithmic patterns to natural language-in a reliable, generalizable way remains a challenging problem for neural language models. Past work has shown that recurrent neural networks (RNNs) struggle to generalize on held-out algorithmic or syntactic patterns without supervision or some inductive bias. To remedy this, many papers have explored augmenting RNNs with various differentiable stacks, by analogy with finite automata and pushdown automata (PDAs). In this paper, we improve the performance of our recently proposed Nondeterministic Stack RNN (NS-RNN), which uses a differentiable data structure that simulates a nondeterministic PDA, with two important changes. First, the model now assigns unnormalized positive weights instead of probabilities to stack actions, and we provide an analysis of why this improves training. Second, the model can directly observe the state of the underlying PDA. Our model achieves lower cross-entropy than all previous stack RNNs on five context-free language modeling tasks (within 0.05 nats of the information-theoretic lower bound), including a task on which the NS-RNN previously failed to outperform a deterministic stack RNN baseline. Finally, we propose a restricted version of the NS-RNN that incrementally processes infinitely long sequences, and we present language modeling results on the Penn Treebank.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2109.01982")
get_code_for_paper("2109.01982")
have("2109.01982")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2109.01982.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2109.01982.svg)](https://syntology.ai/paper/2109.01982)

Connect an agent — have() is free.