Beyond Pairwise: Global Zero-shot Temporal Graph Generation

Alon Eirew, Kfir Bar, Ido Dagan
2/16/2025
cs.CL

No confident code implementation found for this paper.

Abstract

Temporal relation extraction (TRE) is a fundamental task in natural language processing (NLP) that involves identifying the temporal relationships between events in a document. Despite the advances in large language models (LLMs), their application to TRE remains limited. Most existing approaches rely on pairwise classification, where event pairs are classified in isolation, leading to computational inefficiency and a lack of global consistency in the resulting temporal graph. In this work, we propose a novel zero-shot method for TRE that generates a document's complete temporal graph in a single step, followed by temporal constraint optimization to refine predictions and enforce temporal consistency across relations. Additionally, we introduce OmniTemp, a new dataset with complete annotations for all pairs of targeted events within a document. Through experiments and analyses, we demonstrate that our method outperforms existing zero-shot approaches and offers a competitive alternative to supervised TRE models.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{eirew2025beyond,
  title  = {Beyond Pairwise: Global Zero-shot Temporal Graph Generation},
  author = {Alon Eirew and Kfir Bar and Ido Dagan},
  year   = {2025},
  eprint = {2502.11114},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.11114v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.11114.svg)](https://codeofpaper.com/paper/2502.11114)

Discussion