2021
DOI: 10.48550/arxiv.2105.14504
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Structured Sentiment Analysis as Dependency Graph Parsing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
12
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(12 citation statements)
references
References 0 publications
0
12
0
Order By: Relevance
“…The model structure is similar to the head-final model structure in (Barnes et al, 2021), while we use a pretrained model in this work. A bert-style (ERNIE-M (Ouyang et al, 2020)) pretrained model takes sentences starting with "[CLS]" token as input.…”
Section: Model Structurementioning
confidence: 99%
See 2 more Smart Citations
“…The model structure is similar to the head-final model structure in (Barnes et al, 2021), while we use a pretrained model in this work. A bert-style (ERNIE-M (Ouyang et al, 2020)) pretrained model takes sentences starting with "[CLS]" token as input.…”
Section: Model Structurementioning
confidence: 99%
“…(He et al, 2019) presents an interactive multi-task learning network(IMN) implemented by a series of a multi-layer CNN modules. Recently, (Barnes et al, 2021) cast the structured sentiment problem as the dependency graph parsing problem, and proposed a method that outperforms the SOTA(state-of-the-art) baselines on In this task, 7 small datasets involving 5 different languages are given, which means our method needs to support multiple languages with limited data. Therefore, in this work, we use ERNIE-M pretrained model as word embedding generator, as it shows SOTA performances in various of NLP tasks in multiple languages.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This paper describes the system developed by the team ZHIXIAOBAO for SemEval-2022 Task 10. We follow the work of (Barnes et al, 2021) to cast the task as dependency graph parsing problem. The predicted opinion tuples are denoted by a directed graph, G = (V, E), for each sentence.…”
Section: Introductionmentioning
confidence: 99%
“…The task aims to extract all elements of the fine-grained sentiment in a text. We cast structured sentiment analysis to the prediction of the sentiment graphs following (Barnes et al, 2021), where nodes are spans of sentiment holders, targets and expressions, and directed edges denote the relation types between them. Our approach closely follows that of semantic dependency parsing (Dozat and Manning, 2018).…”
mentioning
confidence: 99%