Semantic and Sentiment Dual-Enhanced Generative Model for Script Event Prediction (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods to model event associations struggle with semantic ambiguity and embedding bias. |
| Approach: | They propose a Semantic and Sentiment Dual-enhanced Generative Model to address these issues . it leverages two types of script event information to enhance the generative model . |
| Outcome: | The proposed model captures both global and local sentiments of events through its sentiment awareness mechanism. |
Similar Papers
Multi-Relational Script Learning for Discourse Relations (P19-1)
Copied to clipboard
| Challenge: | Existing script knowledge models only represent a single event relationship, co-occurrence . this is coarse for commonsense, which should account for fine-grained relationships . |
| Approach: | They propose to view learning event embedding as a multi-relational problem . they model a rich set of event relations derived from the Penn Discourse Tree Bank . |
| Outcome: | The proposed model captures different aspects of event pairs, including cause and contrast. |
Integrating Deep Event-Level and Script-Level Information for Script Event Prediction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies only consider a single event sequence corresponding to one common protagonist. |
| Approach: | They propose a Transformer-based model which integrates deep event-level and script-level information for script event prediction. |
| Outcome: | The proposed model is superior to existing models on the New York Times corpus . it utilizes rich information in the text to obtain more comprehensive representations . |
Augmentation, Retrieval, Generation: Event Sequence Prediction with a Three-Stage Sequence-to-Sequence Approach (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to predict event sequences are complex and ignore the knowledge of external events. |
| Approach: | They propose a statistical induction problem to generate a sequence of events by exploring the similarity between the given goal and known sequences of events. |
| Outcome: | The proposed model outperforms existing methods on an event sequence prediction task. |
Event Representation Learning Enhanced with External Commonsense Knowledge (D19-1)
Copied to clipboard
| Challenge: | Existing methods to learn event representations from text lack commonsense knowledge about the intents and emotions of event participants. |
| Approach: | They propose to leverage external commonsense knowledge about the intent and sentiment of the event to learn distributed representations for structured events from text. |
| Outcome: | The proposed model improves on hard similarity tasks and yields more precise inferences on subsequent events under given contexts. |
DocScript: Document-level Script Event Prediction (2024.lrec-main)
Copied to clipboard
Puneet Mathur, Vlad I. Morariu, Aparna Garimella, Franck Dernoncourt, Jiuxiang Gu, Ramit Sawhney, Preslav Nakov, Dinesh Manocha, Rajiv Jain
| Challenge: | Existing script event prediction frameworks such as ChatGPT and FlanT5 lack the ability to learn long-range dependencies between events. |
| Approach: | They propose a novel script event prediction task which aims to predict the next event from a candidate list of narrative events in long-form documents. |
| Outcome: | The proposed architecture can learn sequential ordering between events at the document scale. |
Text2Event: Controllable Sequence-to-Structure Generation for End-to-end Event Extraction (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods to extract event records from text decompose complex structure prediction task into multiple subtasks. |
| Approach: | They propose a sequence-to-structure generation paradigm that can extract events from text . they propose unified event extraction, constrained decoding algorithm and curriculum learning algorithm . |
| Outcome: | The proposed method can achieve competitive performance using record-level annotations in both supervised learning and transfer learning settings. |
A Graph Enhanced BERT Model for Event Prediction (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to predict subsequent events use sparsity of event graph to improve performance. |
| Approach: | They propose to automatically build event graph using a BERT model by adding a structured variable to the model to learn to predict event connections. |
| Outcome: | The proposed model outperforms state-of-the-art models on two event prediction tasks. |
From Sentiment Annotations to Sentiment Prediction through Discourse Augmentation (2020.coling-main)
Copied to clipboard
| Challenge: | Existing sentiment analysis models lack temporal information to capture semantics of long texts. |
| Approach: | They propose a framework to exploit task-related discourse structures for sentiment analysis. |
| Outcome: | The proposed framework improves the performance even beyond existing approaches based on human annotated data. |
COMET-M: Reasoning about Multiple Events in Complex Sentences (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing commonsense models that generate event-centric inferences for simple sentences struggle with the complexity of multi-event sentences prevalent in natural text. |
| Approach: | They propose a commonsense model that generates inferences for a target event within a complex sentence using a multi-event inference dataset. |
| Outcome: | The proposed model produces inferences for a target event within a complex sentence taking the complete context into account. |
Dual Encoder: Exploiting the Potential of Syntactic and Semantic for Aspect Sentiment Triplet Extraction (2024.lrec-main)
Copied to clipboard
| Challenge: | Aspect Sentiment Triple Extraction (ASTE) is an advanced natural language processing task. |
| Approach: | They propose a Dual Encoder: Exploiting the potential of Syntactic and Semantic model which maximizes syntactical and semantic relationships among words. |
| Outcome: | The proposed model surpasses the current state-of-the-art on public benchmarks and shows that it is highly efficient. |