Deep RNNs Encode Soft Hierarchical Syntax (P18-2)

Copied to clipboard

Challenge: Existing studies show that syntactic information is useful for a wide variety of NLP tasks.
Approach: They propose to use word-level representations to learn internal representations that capture soft hierarchical notions of syntax from highly varied supervision.
Outcome: The proposed model encodes significant amounts of syntax even without explicit supervision.

Similar Papers

Colorless Green Recurrent Networks Dream Hierarchically (N18-1)

Copied to clipboard

Challenge: Recurrent neural networks (RNNs) can induce non-trivial properties of language.
Approach: They investigate whether RNNs can track hierarchical syntactic structure . they include nonsensical sentences where RNN cannot rely on semantic cues .
Outcome: The proposed models can predict long-distance agreement in nonsensical sentences in Italian and English.
RNNs can generate bounded hierarchical languages with optimal memory (2020.emnlp-main)

Copied to clipboard

Challenge: Existing studies have shown that RNNs can efficiently generate bounded hierarchical languages with high syntactic fidelity, but their success is not well-understood theoretically.
Approach: They propose a language of well-nested brackets and m-bounded nesting depth . they prove that an RNN with O(m log k) hidden units suffices, an exponential reduction in memory, by an explicit construction.
Outcome: The proposed language is well-nested brackets and has m-bounded nesting depth . it shows that an RNN with O(m log k) hidden units suffices, an exponential reduction in memory, by an explicit construction.
On Efficiently Representing Regular Languages as RNNs (2024.findings-acl)

Copied to clipboard

Challenge: Recent work by Hewitt et al. (2020) provides an interpretation of the empirical success of recurrent neural networks (RNNs) as language models (LMs).
Approach: They generalize their construction and show that RNNs can efficiently represent a larger class of LMs than previously claimed.
Outcome: The results suggest that RNNs can represent a larger class of LMs than previously claimed .
Recurrent Neural Networks with Mixed Hierarchical Structures and EM Algorithm for Natural Language Processing (2022.lrec-1)

Copied to clipboard

Challenge: A variety of hierarchical RNN models have been proposed to incorporate hierarchically-based hierarchic information in modeling languages in the literature.
Approach: They propose a latent indicator layer approach to identify and learn hierarchical information and develop an EM algorithm to handle the latent indicators layer in training.
Outcome: The proposed approach outperforms other RNN-based models in document classification tasks.
The Importance of Being Recurrent for Modeling Hierarchical Structure (D18-1)

Copied to clipboard

Challenge: Recent work shows that recurrent neural networks can implicitly capture hierarchical information when trained to solve common natural language processing tasks.
Approach: They propose a convolutional sequence-to-sequence model that exploits hierarchical information implicitly.
Outcome: The proposed model is recurrent and non-recurrent, and it can model hierarchical structure implicitly.
On the Practical Ability of Recurrent Neural Networks to Recognize Hierarchical Languages (2020.coling-main)

Copied to clipboard

Challenge: recurrent models have been effective in NLP tasks but performance on context-free languages (CFLs) is weak.
Approach: They evaluate the performance of recurrent models on Dyck-n languages . they find that they are expressive enough to recognize Dyck words of arbitrary lengths if their depths are bounded.
Outcome: The proposed models generalize well on Dyck-n languages, while performing poorly on longer test strings.
Improving Text Understanding via Deep Syntax-Semantics Communication (2020.findings-emnlp)

Copied to clipboard

Challenge: Recent studies show that integrating syntactic tree models with sequential semantic models can bring improved task performance.
Approach: They propose a deep neural communication model between syntax and semantics to improve the performance of text understanding.
Outcome: The proposed model outperforms baseline models on syntax-dependent tasks by a large margin.
How LSTM Encodes Syntax: Exploring Context Vectors and Semi-Quantization on Natural Text (2020.coling-main)

Copied to clipboard

Challenge: LSTMs are widely used to capture informative long-term syntactic dependencies, but how they are reflected in their internal vectors for natural text has not been adequately investigated.
Approach: They analyze how syntactic dependencies are reflected in LSTM's internal gates by learning a language model where syntaktic structures are implicitly given.
Outcome: The proposed model can predict whether a word is inside a phrase structure or not from a small number of components of the context-update vector.
Randomized Deep Structured Prediction for Discourse-Level Processing (2021.eacl-main)

Copied to clipboard

Challenge: Expressive text encoders have been at the center of recent NLP work . however, some tasks require complex structural dependencies between texts .
Approach: They propose to leverage deep structured prediction and expressive neural encoders for argumentation mining tasks.
Outcome: The proposed framework can be used for argumentation mining tasks without expensive inference tools.
LSTMs Compose—and Learn—Bottom-Up (2020.findings-emnlp)

Copied to clipboard

Challenge: Recent work in NLP shows that LSTMs capture compositional structure in language data.
Approach: They propose to measure the decompositional interdependence between word meanings in an LSTM based on their gate interactions.
Outcome: The proposed model can model syntactic relationships rather than learning the longer-range relations independently.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations