Revisiting Structured Sentiment Analysis as Latent Dependency Graph Parsing (2024.acl-long)
Copied to clipboard
| Challenge: | Structured Sentiment Analysis (SSA) is a problem of bi-lexical dependency graph parsing due to the internal structures of spans neglected. |
| Approach: | They propose to use latent spans as latent subtrees to model internal structures of spans and leverage TreeCRFs to extract the complete opinion tuple from a sentence. |
| Outcome: | The proposed method performs significantly better than all previous bi-lexical methods, achieving new state-of-the-art. |
Similar Papers
Structured Sentiment Analysis as Dependency Graph Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | Structured sentiment analysis attempts to extract full opinion tuples from a text, but has been subdivided into smaller and smaller sub-tasks, e.g., target extraction or targeted polarity classification. |
| Approach: | They propose a framework which jointly predicts all elements of an opinion tuple and their relations by using dependency graph parsing. |
| Outcome: | The proposed framework improves on five datasets in English, Norwegian, Basque, and Catalan and refining the sentiment graphs with syntactic dependency information further improves results. |
USSA: A Unified Table Filling Scheme for Structured Sentiment Analysis (2023.acl-long)
Copied to clipboard
| Challenge: | Structured Sentiment Analysis (SSA) is a problem of bi-lexical dependency parsing . previous studies have cast it as a bottleneck because of overlap and discontinuity issues . |
| Approach: | They propose a bi-lexical dependency parsing graph and a table-filling scheme that addresses overlap and discontinuity issues. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on benchmark datasets. |
Effective Token Graph Modeling using a Novel Labeling Strategy for Structured Sentiment Analysis (2022.acl-long)
Copied to clipboard
| Challenge: | Structured sentiment analysis is a dependency parsing problem, with imbalanced label distributions and large text spans. |
| Approach: | They propose a novel labeling strategy which contains two sets of token pair labels . they propose tuple extraction problem with a more balanced label distribution . |
| Outcome: | The proposed model outperforms existing models on 5 benchmark datasets in four languages. |
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. |
Discrete Opinion Tree Induction for Aspect-based Sentiment Analysis (2022.acl-long)
Copied to clipboard
| Challenge: | Dependency trees are used for aspect-based sentiment classification but are not optimized for aspect classification. |
| Approach: | They propose an aspect-specific and language-agnostic discrete latent opinion tree model as an alternative structure to explicit dependency trees. |
| Outcome: | The proposed model can achieve competitive performance and interpretability on six English benchmarks and one Chinese dataset. |
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. |
Semantic Role Labeling as Dependency Parsing: Exploring Latent Tree Structures inside Arguments (2022.coling-1)
Copied to clipboard
| Challenge: | Recent works of SRL mainly fall into two lines: 1) BIO-based; 2) span-based. |
| Approach: | They propose to regard flat argument spans as latent subtrees, thus reducing SRL to a tree parsing task. |
| Outcome: | The proposed model performs better than previous syntax-agnostic models on CoNLL05 and CoNll12 benchmarks. |
Direct parsing to sentiment graphs (2022.acl-short)
Copied to clipboard
| Challenge: | Existing methods for structured sentiment analysis (SSA) focus on subcomponents of sentiment graphs without explicitly expressing their relations or the polarity. |
| Approach: | They propose a graph-based semantic parser which directly predicts sentiment graphs from text without reliance on lossy conversions to intermediate dependency representations. |
| Outcome: | The proposed model performs on 4 out of 5 standard benchmark sets and compares with dependency-based models on the more structurally complex datasets. |
Graph Ensemble Learning over Multiple Dependency Trees for Aspect-level Sentiment Classification (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent work on aspect-level sentiment classification has shown that syntactic information is effective in capturing long-range syntaktic relations that are obscure from the surface form. |
| Approach: | They propose a graph ensemble technique that integrates syntactic structures with GNNs to better leverage syntaktic information in the face of parsing errors. |
| Outcome: | The proposed model outperforms models with single dependency tree and beats other models without adding model parameters. |
Dependency Parsing as MRC-based Span-Span Prediction (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing address the issue that edges should be constructed at the text span/subtree level rather than word level. |
| Approach: | They propose a method that constructs dependency trees by directly modeling span-span relations by modeling subtree-subtree relationships. |
| Outcome: | The proposed method constructs dependency trees by modeling span-span relations . it can retrieve missing spans in the span proposal stage, which leads to higher recall . |