mlsanityData to 13 Oct 2026

The University of Texas at Dallas HLTRI's Participation in EPIC-QA: Searching for Entailed Questions Revealing Novel Answer Nuggets

arXiv 2112.13946 ↗First posted 28 Dec 2021cs.CL cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

The Epidemic Question Answering (EPIC-QA) track at the Text Analysis Conference (TAC) is an evaluation of methodologies for answering ad-hoc questions about the COVID-19 disease. This paper describes our participation in both tasks of EPIC-QA, targeting: (1) Expert QA and (2) Consumer QA. Our methods used a multi-phase neural Information Retrieval (IR) system based on combining BM25, BERT, and T5 as well as the idea of considering entailment relations between the original question and questions automatically generated from answer candidate sentences. Moreover, because entailment relations were also considered between all generated questions, we were able to re-rank the answer sentences based on the number of novel answer nuggets they contained, as indicated by the processing of a question entailment graph. Our system, called SEaRching for Entailed QUestions revealing NOVel nuggets of Answers (SER4EQUNOVA), produced promising results in both EPIC-QA tasks, excelling in the Expert QA task.

Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 6 of its 12 references that are in the map. First posted on arXiv 28 Dec 2021.

Builds on

6 of 12 references.

References · 6

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,304
  2. 2019BioBERT: a pre-trained biomedical language representation model for biomedical text miningcited by 1,942
  3. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,600
  4. 2019Passage Re-ranking with BERTcited by 638
  5. 2019Document Expansion by Query Predictioncited by 226
  6. 2019A Question-Entailment Approach to Question Answeringcited by 134

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 1.

3 papers.