Challenge: Existing work on tree structures uses syntactic parsers or Treebank annotations to perform target-dependent classifications.
Approach: They propose a reinforcement learning based approach which automatically induces target-specific sentence representations over tree structures.
Outcome: The proposed model gives superior performance on two benchmark tasks compared to previous work on parsed trees .

Similar Papers

Unifying Parsing and Tree-Structured Models for Generating Sentence Semantic Representations (2022.naacl-srw)

Copied to clipboard

Challenge: Existing tree-based models require handannotated data to be trained.
Approach: They propose a tree-based model that learns its composition function together with its structure.
Outcome: The proposed model outperforms existing models on downstream tasks and is competitive with Bert base model.
Inducing Target-Specific Latent Structures for Aspect Sentiment Classification (2020.emnlp-main)

Copied to clipboard

Challenge: Aspect-level sentiment analysis aims to classify the sentiment polarity of an aspect or a target in a comment . graph convolutional networks can be used to classifice aspect terms in syllables .
Approach: They propose to combine word dependency graphs and latent graphs to create latent models . they propose to model the interaction between the aspect and its surrounding contexts .
Outcome: The proposed model can complement syntactic features with latent semantic dependencies.
On Tree-Based Neural Sentence Modeling (D18-1)

Copied to clipboard

Challenge: Existing tree-based sentence modeling approaches adopt syntactic parsing trees as the explicit structure prior.
Approach: They replace parsing trees with trivial trees to study their effectiveness . they found that tree-based sentence modeling gives better results when crucial words are closer to the final representation .
Outcome: The proposed tree-based sentences have shown better results on many downstream tasks.
Dependency parsing with structure preserving embeddings (2021.eacl-main)

Copied to clipboard

Challenge: Modern neural approaches to dependency parsing are trained to predict a tree structure by learning a contextual representation for tokens in a sentence and a head–dependent scoring function.
Approach: They propose to combine a contextual representation for tokens and a head–dependent scoring function to learn interpretable representations by training a parser to explicitly preserve structural properties of a tree.
Outcome: The proposed approach yields strong tree distance preservation and parsing performance on par with a competitive graph-based parser.
Tree Transformer: Integrating Tree Structures into Self-Attention (D19-1)

Copied to clipboard

Challenge: Existing work on hierarchical structure in neural networks has not captured human intuitions about hierarchic structures.
Approach: They propose to add an extra constraint to attention heads of the bidirectional Transformer encoder to encourage attention heads to follow tree structures.
Outcome: The proposed model improves language modeling and learning more explainable attention scores.
Aspect-Level Sentiment Analysis Via Convolution over Dependency Tree (D19-1)

Copied to clipboard

Challenge: Existing methods to identify sentiment polarity of opinion words are cumbersome due to the amount of opinionated material on the internet.
Approach: They propose a method to identify sentiment polarity of opinion words on a specific aspect of a sentence using neural networks.
Outcome: The proposed method is the state-of-the-art in aspect-based sentiment classification.
A Tree-based Decoder for Neural Machine Translation (D18-1)

Copied to clipboard

Challenge: Existing work on adding syntactic information to NMT systems is limited to linguistically-inspired tree structures.
Approach: They propose an NMT model that can naturally generate the topology of an arbitrary tree structure on the target side.
Outcome: The proposed model outperforms standard seq2seq models by 2.1 BLEU points and other methods for incorporating target-side syntax by 0.7 BLUE points.
AMR Parsing with Latent Structural Information (2020.acl-main)

Copied to clipboard

Challenge: Abstract Meaning Representations (AMRs) capture sentence-level semantics structural representations to broad-coverage natural sentences.
Approach: They investigate parsing AMR with explicit dependency structures and interpretable latent structures.
Outcome: The proposed model achieves best results on both AMR 2.0 and AMR 1.0 . the proposed model has been adopted in downstream NLP tasks, including text summarization and question answering.
Dynamic Meta-Embeddings for Improved Sentence Representations (D18-1)

Copied to clipboard

Challenge: A sprawling literature has emerged about what word embeddings are most useful for which tasks . word embed-ding is a technique that can be used to learn word-level meaning representations for a variety of tasks.
Approach: They propose a method for supervised learning of embedding ensembles that leads to state-of-the-art performance on a variety of tasks.
Outcome: The proposed method leads to state-of-the-art performance on a variety of tasks.
Self-Attention with Structural Position Representations (D19-1)

Copied to clipboard

Challenge: Experimental results show that SANs can't encode positions of input words . SAN's are currently lacking in encoding positions of words based on position-unaware "bagof-words" theory .
Approach: They propose to augment SANs with structural position representations to capture latent structure of input sentence.
Outcome: The proposed approach consistently outperforms the sequential representations on translation tasks.

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