Interpreting Sentiment Composition with Latent Semantic Tree
- URL: http://arxiv.org/abs/2308.16588v1
- Date: Thu, 31 Aug 2023 09:35:52 GMT
- Title: Interpreting Sentiment Composition with Latent Semantic Tree
- Authors: Zhongtao Jiang, Yuanzhe Zhang, Cao Liu, Jiansong Chen, Jun Zhao, Kang
Liu
- Abstract summary: We propose semantic tree, a new tree form capable of interpreting the sentiment composition in a principled way.
Semantic tree is a derivation of a context-free grammar (CFG) describing the specific composition rules on difference semantic roles.
Our method achieves better or competitive results compared to baselines in the setting of regular and domain adaptation classification.
- Score: 21.008695645095038
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As the key to sentiment analysis, sentiment composition considers the
classification of a constituent via classifications of its contained
sub-constituents and rules operated on them. Such compositionality has been
widely studied previously in the form of hierarchical trees including untagged
and sentiment ones, which are intrinsically suboptimal in our view. To address
this, we propose semantic tree, a new tree form capable of interpreting the
sentiment composition in a principled way. Semantic tree is a derivation of a
context-free grammar (CFG) describing the specific composition rules on
difference semantic roles, which is designed carefully following previous
linguistic conclusions. However, semantic tree is a latent variable since there
is no its annotation in regular datasets. Thus, in our method, it is
marginalized out via inside algorithm and learned to optimize the
classification performance. Quantitative and qualitative results demonstrate
that our method not only achieves better or competitive results compared to
baselines in the setting of regular and domain adaptation classification, and
also generates plausible tree explanations.
Related papers
- Integrating Hierarchical Semantic into Iterative Generation Model for Entailment Tree Explanation [7.5496857647335585]
We propose an architecture of integrating the Hierarchical Semantics of sentences under the framework of Controller-Generator (HiSCG) to explain answers.
The proposed method achieves comparable performance on all three settings of the EntailmentBank dataset.
arXiv Detail & Related papers (2024-09-26T11:46:58Z) - Domain Embeddings for Generating Complex Descriptions of Concepts in
Italian Language [65.268245109828]
We propose a Distributional Semantic resource enriched with linguistic and lexical information extracted from electronic dictionaries.
The resource comprises 21 domain-specific matrices, one comprehensive matrix, and a Graphical User Interface.
Our model facilitates the generation of reasoned semantic descriptions of concepts by selecting matrices directly associated with concrete conceptual knowledge.
arXiv Detail & Related papers (2024-02-26T15:04:35Z) - Advancing Incremental Few-shot Semantic Segmentation via Semantic-guided
Relation Alignment and Adaptation [98.51938442785179]
Incremental few-shot semantic segmentation aims to incrementally extend a semantic segmentation model to novel classes.
This task faces a severe semantic-aliasing issue between base and novel classes due to data imbalance.
We propose the Semantic-guided Relation Alignment and Adaptation (SRAA) method that fully considers the guidance of prior semantic information.
arXiv Detail & Related papers (2023-05-18T10:40:52Z) - Variational Cross-Graph Reasoning and Adaptive Structured Semantics
Learning for Compositional Temporal Grounding [143.5927158318524]
Temporal grounding is the task of locating a specific segment from an untrimmed video according to a query sentence.
We introduce a new Compositional Temporal Grounding task and construct two new dataset splits.
We argue that the inherent structured semantics inside the videos and language is the crucial factor to achieve compositional generalization.
arXiv Detail & Related papers (2023-01-22T08:02:23Z) - Fine-tuning a Subtle Parsing Distinction Using a Probabilistic Decision
Tree: the Case of Postnominal "that" in Noun Complement Clauses vs. Relative
Clauses [0.0]
We investigated two methods to parse relative and noun complement clauses in English.
We used an algorithm to relabel a corpus parsed with the GUM Treebank using Universal Dependency.
Our second experiment consisted in using TreeTagger, a Probabilistic Decision Tree, to learn the distinction between the two complement and relative uses of postnominal "that"
arXiv Detail & Related papers (2022-12-05T20:52:41Z) - A Mathematical Programming Approach to Optimal Classification Forests [1.0705399532413618]
We propose a novel mathematical optimization-based methodology in which a given number of trees are simultaneously constructed.
The classification rule is derived by assigning to each observation its most frequently predicted class among the trees in the forest.
We show that our proposed method has equal or superior performance compared with state-of-the-art tree-based classification methods.
arXiv Detail & Related papers (2022-11-18T20:33:08Z) - Compositional Temporal Grounding with Structured Variational Cross-Graph
Correspondence Learning [92.07643510310766]
Temporal grounding in videos aims to localize one target video segment that semantically corresponds to a given query sentence.
We introduce a new Compositional Temporal Grounding task and construct two new dataset splits.
We empirically find that they fail to generalize to queries with novel combinations of seen words.
We propose a variational cross-graph reasoning framework that explicitly decomposes video and language into multiple structured hierarchies.
arXiv Detail & Related papers (2022-03-24T12:55:23Z) - To be Closer: Learning to Link up Aspects with Opinions [18.956990787407793]
Dependency parse trees are helpful for discovering the opinion words in aspect-based sentiment analysis (ABSA)
In this work, we aim to shorten the distance between aspects and corresponding opinion words by learning an aspect-centric tree structure.
The learning process allows the tree structure to adaptively correlate the aspect and opinion words, enabling us to better identify the polarity in the ABSA task.
arXiv Detail & Related papers (2021-09-17T07:37:13Z) - Compositional Generalization via Semantic Tagging [81.24269148865555]
We propose a new decoding framework that preserves the expressivity and generality of sequence-to-sequence models.
We show that the proposed approach consistently improves compositional generalization across model architectures, domains, and semantic formalisms.
arXiv Detail & Related papers (2020-10-22T15:55:15Z) - SentiBERT: A Transferable Transformer-Based Architecture for
Compositional Sentiment Semantics [82.51956663674747]
SentiBERT is a variant of BERT that effectively captures compositional sentiment semantics.
We show that SentiBERT achieves competitive performance on phrase-level sentiment classification.
arXiv Detail & Related papers (2020-05-08T15:40:17Z)
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.