Revisiting Structured Sentiment Analysis as Latent Dependency Graph Parsing

• URL: http://arxiv.org/abs/2407.04801v1
• Date: Fri, 5 Jul 2024 18:18:50 GMT
• Title: Revisiting Structured Sentiment Analysis as Latent Dependency Graph Parsing
• Authors: Chengjie Zhou, Bobo Li, Hao Fei, Fei Li, Chong Teng, Donghong Ji,
• Abstract summary: Internal structures of spans are neglected, thus only the boundary tokens of spans are used for relation prediction and span recognition. Long spans occupy a significant proportion in the SSA datasets, which further exacerbates the problem of internal structure neglect. We propose a two-stage parsing method and leverage TreeCRFs with a novel constrained inside algorithm to model latent structures explicitly.
• Score: 38.27437431585664
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Structured Sentiment Analysis (SSA) was cast as a problem of bi-lexical dependency graph parsing by prior studies. Multiple formulations have been proposed to construct the graph, which share several intrinsic drawbacks: (1) The internal structures of spans are neglected, thus only the boundary tokens of spans are used for relation prediction and span recognition, thus hindering the model's expressiveness; (2) Long spans occupy a significant proportion in the SSA datasets, which further exacerbates the problem of internal structure neglect. In this paper, we treat the SSA task as a dependency parsing task on partially-observed dependency trees, regarding flat spans without determined tree annotations as latent subtrees to consider internal structures of spans. We propose a two-stage parsing method and leverage TreeCRFs with a novel constrained inside algorithm to model latent structures explicitly, which also takes advantages of joint scoring graph arcs and headed spans for global optimization and inference. Results of extensive experiments on five benchmark datasets reveal that our method performs significantly better than all previous bi-lexical methods, achieving new state-of-the-art.

Related papers

• S$^2$GSL: Incorporating Segment to Syntactic Enhanced Graph Structure Learning for Aspect-based Sentiment Analysis [19.740223755240734]
  We propose S$2$GSL, incorporating Segment to Syntactic enhanced Graph Structure Learning for ABSA. S$2$GSL is featured with a segment-aware semantic graph learning and a syntax-based latent graph learning.
  arXiv  Detail & Related papers  (2024-06-05T03:44:35Z)
• Enhancing Systematic Decompositional Natural Language Inference Using Informal Logic [51.967603572656266]
  We introduce a consistent and theoretically grounded approach to annotating decompositional entailment. We find that our new dataset, RDTE, has a substantially higher internal consistency (+9%) than prior decompositional entailment datasets. We also find that training an RDTE-oriented entailment classifier via knowledge distillation and employing it in an entailment tree reasoning engine significantly improves both accuracy and proof quality.
  arXiv  Detail & Related papers  (2024-02-22T18:55:17Z)
• RDGCN: Reinforced Dependency Graph Convolutional Network for Aspect-based Sentiment Analysis [43.715099882489376]
  We propose a new reinforced dependency graph convolutional network (RDGCN) that improves the importance calculation of dependencies in both distance and type views. Under the criterion, we design a distance-importance function that leverages reinforcement learning for weight distribution search and dissimilarity control. Comprehensive experiments on three popular datasets demonstrate the effectiveness of the criterion and importance functions.
  arXiv  Detail & Related papers  (2023-11-08T05:37:49Z)
• Topic-driven Distant Supervision Framework for Macro-level Discourse Parsing [72.14449502499535]
  The task of analyzing the internal rhetorical structure of texts is a challenging problem in natural language processing. Despite the recent advances in neural models, the lack of large-scale, high-quality corpora for training remains a major obstacle. Recent studies have attempted to overcome this limitation by using distant supervision.
  arXiv  Detail & Related papers  (2023-05-23T07:13:51Z)
• Semantic Role Labeling as Dependency Parsing: Exploring Latent Tree Structures Inside Arguments [33.95412952615206]
  Recent works of SRL mainly fall into two lines:1) BIO-based and 2) span-based. We propose to reduce SRL to a dependency parsing task and regard the flat argument spans as latent subtrees. In particular, we equip our formulation with a novel span-constrained TreeCRF model to make tree structures span-aware.
  arXiv  Detail & Related papers  (2021-10-13T17:02:29Z)
• Sparse Fuzzy Attention for Structured Sentiment Analysis [48.69930912510414]
  We propose a sparse and fuzzy attention scorer with pooling layers which improves performance and sets the new state-of-the-art on structured sentiment analysis. We further explore the parsing modeling on structured sentiment analysis with second-order parsing and introduce a novel sparse second-order edge building procedure that leads to significant improvement in parsing performance.
  arXiv  Detail & Related papers  (2021-09-14T14:37:56Z)
• Learning compositional structures for semantic graph parsing [81.41592892863979]
  We show how AM dependency parsing can be trained directly on a neural latent-variable model. Our model picks up on several linguistic phenomena on its own and achieves comparable accuracy to supervised training.
  arXiv  Detail & Related papers  (2021-06-08T14:20:07Z)
• Structured Sentiment Analysis as Dependency Graph Parsing [5.174808367448261]
  We argue that this division has become counterproductive and propose a new unified framework to remedy the situation. We cast the structured sentiment problem as dependency graph parsing, where the nodes are spans of sentiment holders, targets and expressions, and the arcs are the relations between them.
  arXiv  Detail & Related papers  (2021-05-30T11:19:46Z)
• A Dependency Syntactic Knowledge Augmented Interactive Architecture for End-to-End Aspect-based Sentiment Analysis [73.74885246830611]
  We propose a novel dependency syntactic knowledge augmented interactive architecture with multi-task learning for end-to-end ABSA. This model is capable of fully exploiting the syntactic knowledge (dependency relations and types) by leveraging a well-designed Dependency Relation Embedded Graph Convolutional Network (DreGcn) Extensive experimental results on three benchmark datasets demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-04-04T14:59:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.