paper-with-me

Papers

Open Temporal Relation Extraction for Question Answering

2021-06-22 · AKBC 2021 10 · Chao Shang, Peng Qi, Guangtao Wang, Jing Huang, Youzheng Wu, BoWen Zhou

Understanding the temporal relations among events in text is a critical aspect of reading comprehension, which can be evaluated in the form of temporal question answering (TQA). When explicit timestamps are absent, TQA is a challenging task that requires models to understand the nuanced difference in textual expressions that indicate different temporal relations (e.g., "What happened right before dawn" indicates a small subset of "What happened before dawn"). In this paper, we propose to reformulate the task of TQA as open temporal relation extraction. Specifically, we decompose each question into a question event (e.g., "dawn") and an open temporal relation (OTR, e.g., "happened before") which is not pre-defined nor with timestamps, and ground the former in the context while sharing the representation of the latter across contexts. This OTR for QA formulation has two advantages: 1) it allows us to learn context-agnostic, free-text-based relation representations that generalize across different contexts and events, which leads to higher data efficiency; 2) it allows us to explicitly model the differences in temporal relations with a contrastive loss function, which helps better capture mutually exclusive relations (e.g., an event cannot simultaneously "happen before" and "happen after" another) as well as more nuanced differences (e.g., not everything that "happened before" an event "happened right before" it). Empirical evaluations on the TORQUE challenge, a recently released dataset for temporal ordering questions, show that our approach attains significant improvements correspondingly over the state of the art performance, especially gains more on EM consistency computed on the contrast question sets.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Question AnsweringReading ComprehensionRelationRelation ExtractionTemporal Relation Extraction

Similar Papers 제목 키워드 기반

Targeted Extraction of Temporal Facts from Textual Resources for Improved Temporal Question Answering over Knowledge Bases

2022-03-21 · Nithish Kannen, Udit Sharma, Sumit Neelam, Dinesh Khandelwal 외

Knowledge Base Question Answering (KBQA) systems have the goal of answering complex natural language questions by reasoning over relevant facts retrieved from Knowledge Bases (KB). One of the major challenges faced by th…

Knowledge Base Question AnsweringOpen-Domain Question AnsweringQuestion AnsweringRelation Linking

Fusing Temporal Graphs into Transformers for Time-Sensitive Question Answering

2023-10-30 · Xin Su, Phillip Howard, Nagib Hakim, Steven Bethard

Answering time-sensitive questions from long documents requires temporal reasoning over the times in questions and documents. An important open question is whether large language models can perform such reasoning solely …

Question AnsweringTemporal Information Extraction

Answering Complex Questions Using Open Information Extraction

2017-04-19 · ACL 2017 7 · Tushar Khot, Ashish Sabharwal, Peter Clark

While there has been substantial progress in factoid question-answering (QA), answering complex questions remains challenging, typically requiring both a large body of knowledge and inference techniques. Open Information…

Open Information ExtractionQuestion AnsweringRetrieval

QA4IE: A Question Answering based Framework for Information Extraction

2018-04-10 · Lin Qiu, Hao Zhou, Yanru Qu, Wei-Nan Zhang 외

Information Extraction (IE) refers to automatically extracting structured relation tuples from unstructured texts. Common IE solutions, including Relation Extraction (RE) and open IE systems, can hardly handle cross-sent…

Question AnsweringRelationRelation ExtractionSentence

UHop: An Unrestricted-Hop Relation Extraction Framework for Knowledge-Based Question Answering

2019-04-02 · NAACL 2019 6 · Zi-Yuan Chen, Chih-Hung Chang, Yi-Pei Chen, Jijnasa Nayak 외

In relation extraction for knowledge-based question answering, searching from one entity to another entity via a single relation is called "one hop". In related work, an exhaustive search from all one-hop relations, two-…

Question AnsweringRelationRelation Extraction