Finding Hierarchical Structure in Neural Stacks Using Unsupervised Parsing

Citations Over TimeTop 22% of 2019 papers

Abstract

Neural network architectures have been augmented with differentiable stacks in order to introduce a bias toward learning hierarchysensitive 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.

Related Papers

• → A Characterization for Generalized Hukuhara Differentiable Interval-Valued Functions and Some Rules of Calculus(2022)2 cited
• → Continuous Differentiability in the Context of Generalized Approach to Differentiability(2023)1 cited
• On binary function continuity,differentiability and may differentiability(2012)