Structured Sentiment Analysis as Transition-based Dependency Parsing
- URL: http://arxiv.org/abs/2305.05311v1
- Date: Tue, 9 May 2023 10:03:34 GMT
- Title: Structured Sentiment Analysis as Transition-based Dependency Parsing
- Authors: Daniel Fern\'andez-Gonz\'alez
- Abstract summary: Structured sentiment analysis aims to automatically extract people's opinions from a text in natural language.
One of the most accurate methods for performing SSA was recently proposed and consists of approaching it as a dependency parsing task.
We present the first transition-based method to address SSA as dependency parsing.
- Score: 0.40611352512781856
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Structured sentiment analysis (SSA) aims to automatically extract people's
opinions from a text in natural language and adequately represent that
information in a graph structure. One of the most accurate methods for
performing SSA was recently proposed and consists of approaching it as a
dependency parsing task. Although we can find in the literature how
transition-based algorithms excel in dependency parsing in terms of accuracy
and efficiency, all proposed attempts to tackle SSA following that approach
were based on graph-based models. In this article, we present the first
transition-based method to address SSA as dependency parsing. Specifically, we
design a transition system that processes the input text in a left-to-right
pass, incrementally generating the graph structure containing all identified
opinions. To effectively implement our final transition-based model, we resort
to a Pointer Network architecture as a backbone. From an extensive evaluation,
we demonstrate that our model offers the best performance to date in
practically all cases among prior dependency-based methods, and surpass recent
task-specific techniques on the most challenging datasets. We additionally
include an in-depth analysis and empirically prove that the overall
time-complexity cost of our approach is quadratic in the sentence length, being
more efficient than top-performing graph-based parsers.
Related papers
- Transforming Engineering Diagrams: A Novel Approach for P&ID Digitization using Transformers [2.5056643038238495]
We propose a novel approach that utilizes the Relationformer, a state-of-the-art deep learning architecture, to extract graphs from P&IDs.
We present PID2Graph, the first publicly accessible P&ID dataset featuring comprehensive labels for the graph structure.
For the real-world data, the Relationformer achieves convincing results, outperforming the modular digitization approach for edge detection by more than 25%.
arXiv Detail & Related papers (2024-11-21T08:27:18Z) - Structure Your Data: Towards Semantic Graph Counterfactuals [1.8817715864806608]
Counterfactual explanations (CEs) based on concepts are explanations that consider alternative scenarios to understand which high-level semantic features contributed to model predictions.
In this work, we propose CEs based on the semantic graphs accompanying input data to achieve more descriptive, accurate, and human-aligned explanations.
arXiv Detail & Related papers (2024-03-11T08:40:37Z) - Contrastive Transformer Learning with Proximity Data Generation for
Text-Based Person Search [60.626459715780605]
Given a descriptive text query, text-based person search aims to retrieve the best-matched target person from an image gallery.
Such a cross-modal retrieval task is quite challenging due to significant modality gap, fine-grained differences and insufficiency of annotated data.
In this paper, we propose a simple yet effective dual Transformer model for text-based person search.
arXiv Detail & Related papers (2023-11-15T16:26:49Z) - MinPrompt: Graph-based Minimal Prompt Data Augmentation for Few-shot Question Answering [64.6741991162092]
We present MinPrompt, a minimal data augmentation framework for open-domain question answering.
We transform the raw text into a graph structure to build connections between different factual sentences.
We then apply graph algorithms to identify the minimal set of sentences needed to cover the most information in the raw text.
We generate QA pairs based on the identified sentence subset and train the model on the selected sentences to obtain the final model.
arXiv Detail & Related papers (2023-10-08T04:44:36Z) - Active Learning for Abstractive Text Summarization [50.79416783266641]
We propose the first effective query strategy for Active Learning in abstractive text summarization.
We show that using our strategy in AL annotation helps to improve the model performance in terms of ROUGE and consistency scores.
arXiv Detail & Related papers (2023-01-09T10:33:14Z) - Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph
Construction [57.854498238624366]
We propose a retrieval-augmented approach, which retrieves schema-aware Reference As Prompt (RAP) for data-efficient knowledge graph construction.
RAP can dynamically leverage schema and knowledge inherited from human-annotated and weak-supervised data as a prompt for each sample.
arXiv Detail & Related papers (2022-10-19T16:40:28Z) - Comparative Code Structure Analysis using Deep Learning for Performance
Prediction [18.226950022938954]
This paper aims to assess the feasibility of using purely static information (e.g., abstract syntax tree or AST) of applications to predict performance change based on the change in code structure.
Our evaluations of several deep embedding learning methods demonstrate that tree-based Long Short-Term Memory (LSTM) models can leverage the hierarchical structure of source-code to discover latent representations and achieve up to 84% (individual problem) and 73% (combined dataset with multiple of problems) accuracy in predicting the change in performance.
arXiv Detail & Related papers (2021-02-12T16:59:12Z) - Probabilistic Case-based Reasoning for Open-World Knowledge Graph
Completion [59.549664231655726]
A case-based reasoning (CBR) system solves a new problem by retrieving cases' that are similar to the given problem.
In this paper, we demonstrate that such a system is achievable for reasoning in knowledge-bases (KBs)
Our approach predicts attributes for an entity by gathering reasoning paths from similar entities in the KB.
arXiv Detail & Related papers (2020-10-07T17:48:12Z) - Transition-based Semantic Dependency Parsing with Pointer Networks [0.34376560669160383]
We propose a transition system that can straightforwardly produce labelled directed acyclic graphs and perform semantic dependency parsing.
We enhance our approach with deep contextualized word embeddings extracted from BERT.
The resulting system not only outperforms all existing transition-based models, but also matches the best fully-supervised accuracy to date on SemEval 2015 18 English datasets.
arXiv Detail & Related papers (2020-05-27T13:18:27Z) - 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.