| Challenge: | Existing knowledge of narrative examples is lacking and difficult to obtain. |
| Approach: | They propose a weakly supervised approach for acquiring rich temporal event knowledge across sentences in narrative stories. |
| Outcome: | The proposed approach outperforms neural network models on the narrative cloze task. |
Similar Papers
Temporal reasoning for timeline summarisation in social media (2025.acl-long)
Copied to clipboard
| Challenge: | Existing temporal reasoning datasets focus on pair-wise event relationships. |
| Approach: | They propose a temporal reasoning dataset focused on temporal relationships among sequential events within narratives that combines temporal thinking with timeline summarisation through a knowledge distillation framework. |
| Outcome: | The proposed model achieves superior performance on mental health-related timeline summarisation tasks, highlighting the importance and generalisability of leveraging temporal reasoning to improve timeline summaries. |
Temporal Information Extraction by Predicting Relative Time-lines (D18-1)
Copied to clipboard
| Challenge: | a new paradigm for temporal information extraction from text evades the relation extraction phase because there are n 2 possible entity pairs in a text with n temporal entities. |
| Approach: | They propose a method to construct a linear time-line from a set of temporal relations from text without the intermediate step of prediction of tempor relations. |
| Outcome: | The proposed method predicts start and end-points without intermediate step of prediction of temporal relations . it evades phase 2 because there are n 2 possible entity pairs in the extraction phase . |
Go Back in Time: Generating Flashbacks in Stories with Event Temporal Prompts (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing systems that generate *flashbacks* are monotonic and lack explicit guidance on how to insert them. |
| Approach: | They propose to use event temporal orders to encode events as temporal prompts . they leverage a Plan-and-Write framework enhanced by reinforcement learning to generate storylines . |
| Outcome: | The proposed method generates more interesting stories with *flashbacks* while maintaining textual diversity, fluency, and temporal coherence. |
Consistent Discourse-level Temporal Relation Extraction Using Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have spurred research on temporal relation extraction tasks. |
| Approach: | They propose a framework to improve LLMs’ temporal relation extraction capabilities using context selection, prompts inspired by Allen’s interval algebra and reflection-based consistency learning. |
| Outcome: | The proposed framework improves LLMs’ extraction capabilities by focusing on context selection, prompts inspired by Allen’s interval algebra and reflection-based consistency learning. |
Timeline-based Sentence Decomposition with In Context Learning for Temporal Fact Extraction (2024.acl-long)
Copied to clipboard
| Challenge: | Recent research on temporal fact extraction fails to establish time-to-fact correspondences in complex sentences. |
| Approach: | They propose a timeline-based sentence decomposition strategy using large language models with in-context learning to extract temporal facts from natural language text. |
| Outcome: | The proposed method achieves state-of-the-art on a complex temporal fact extraction dataset. |
Temporal Token Matters: Investigating and Interpreting the Consistency of Temporal Ordering in Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) exhibit notable deficiencies in temporal reasoning . phrasing changes can lead LLMs to produce inconsistent outputs . |
| Approach: | They investigate the mechanistic interpretability of temporal ordering within event temporal reasoning . they identify a sparse subset of attention heads that are causally responsible for reasoning outcomes . |
| Outcome: | The proposed model outperforms other models in a variety of tasks and is validated by intervention-based experiments. |
Extracting Temporal Event Relation with Syntax-guided Graph Transformer (2022.findings-naacl)
Copied to clipboard
| Challenge: | Temporal relationship extraction is crucial for understanding complex events and reasoning over them. |
| Approach: | They propose a Syntax-guided Graph Transformer network to extract temporal relations between events by explicitly exploiting the connection between two events based on their dependency parsing trees. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on MATRES and TB-DENSE with up to 7.9% absolute F-score gain. |
NarrativeTime: Dense Temporal Annotation on a Timeline (2024.lrec-main)
Copied to clipboard
| Challenge: | e.g. TimeBank contains 1-5% of all possible tlinks, and this information is underspecified in the text. |
| Approach: | They propose a timeline-based framework that achieves full coverage of all possible TLINKs. |
| Outcome: | The proposed framework achieves full coverage of all possible TLINKs in a text. |
Improving Temporal Relation Extraction with a Globally Acquired Statistical Resource (N18-1)
Copied to clipboard
| Challenge: | Existing temporal extraction systems that extract temporal relations can be improved by using a resource that provides prior knowledge of the temporal order that events usually follow. |
| Approach: | They propose to use a probabilistic knowledge base acquired in the news domain to extract temporal relations between events from the New York Times articles over a 20-year span. |
| Outcome: | The proposed system and resource are both publicly available. |
An Improved Neural Baseline for Temporal Relation Extraction (D19-1)
Copied to clipboard
| Challenge: | Existing datasets are small and/or have low inter-annotator agreements. |
| Approach: | They propose a new neural system that achieves 10% absolute accuracy improvement over the previous best system. |
| Outcome: | The proposed system achieves 10% absolute improvement over the previous best system on two benchmark datasets. |