Incorporating Temporal Information in Entailment Graph Mining

9Citations
Citations of this article
66Readers
Mendeley users who have this article in their library.
Get full text

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 → play, while avoiding the pitfall of learning non-entailments such as win 6→ 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.

Cite

CITATION STYLE

APA

Guillou, L., De Vroe, S. B., Hosseini, M. J., Johnson, M., & Steedman, M. (2020). Incorporating Temporal Information in Entailment Graph Mining. In COLING 2020 - Graph-Based Methods for Natural Language Processing - Proceedings of the 14th Workshop, TextGraphs 2020 (pp. 60–71). Association for Computational Linguistics. https://doi.org/10.18653/v1/2020.textgraphs-1.7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free