Random-branching parsing agents lose their communication-accuracy advantage on Dyck-k hierarchical meaning spaces and show high surprisal on unseen messages, suggesting they are poor models of human language understanding.
Finding Syntactic Representations in Neural Stacks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Neural network architectures have been augmented with differentiable stacks in order to introduce a bias toward learning hierarchy-sensitive regularities. It has, however, proven difficult to assess the degree to which such a bias is effective, as the operation of the differentiable stack is not always interpretable. In this paper, we attempt to detect the presence of latent representations of hierarchical structure through an exploration of the unsupervised learning of constituency structure. Using a technique due to Shen et al. (2018a,b), we extract syntactic trees from the pushing behavior of stack RNNs trained on language modeling and classification objectives. We find that our models produce parses that reflect natural language syntactic constituencies, demonstrating that stack RNNs do indeed infer linguistically relevant hierarchical structure.
citation-role summary
citation-polarity summary
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Why Are Parsing Actions for Understanding Message Hierarchies Not Random?
Random-branching parsing agents lose their communication-accuracy advantage on Dyck-k hierarchical meaning spaces and show high surprisal on unseen messages, suggesting they are poor models of human language understanding.