English

Incorporating Temporal Information in Entailment Graph Mining

Computation and Language 2021-09-21 v1

Abstract

We present a novel method for injecting temporality into entailment graphs to address the problem of spurious entailments, which may arise from similar but temporally distinct events involving the same pair of entities. We focus on the sports domain in which the same pairs of teams play on different occasions, with different outcomes. We present an unsupervised model that aims to learn entailments such as win/lose \rightarrow play, while avoiding the pitfall of learning non-entailments such as win ↛\not\rightarrow lose. We evaluate our model on a manually constructed dataset, showing that incorporating time intervals and applying a temporal window around them, are effective strategies.

Keywords

Cite

@article{arxiv.2109.09412,
  title  = {Incorporating Temporal Information in Entailment Graph Mining},
  author = {Liane Guillou and Sander Bijl de Vroe and Mohammad Javad Hosseini and Mark Johnson and Mark Steedman},
  journal= {arXiv preprint arXiv:2109.09412},
  year   = {2021}
}

Comments

L. Guillou, S. Bijl de Vroe, M.J. Hosseini, M. Johnson, and M. Steedman. 2020. Incorporating temporal information in entailment graph mining. In Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs), pages 60-71, Barcelona, Spain (Online). Association for Computational Linguistics

R2 v1 2026-06-24T06:07:56.667Z