Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Complementary Evidence Identification in Open-Domain Question Answering (2103.11643v3)

Published 22 Mar 2021 in cs.CL

Abstract: This paper proposes a new problem of complementary evidence identification for open-domain question answering (QA). The problem aims to efficiently find a small set of passages that covers full evidence from multiple aspects as to answer a complex question. To this end, we proposes a method that learns vector representations of passages and models the sufficiency and diversity within the selected set, in addition to the relevance between the question and passages. Our experiments demonstrate that our method considers the dependence within the supporting evidence and significantly improves the accuracy of complementary evidence selection in QA domain.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Xiangyang Mou (8 papers)
  2. Mo Yu (117 papers)
  3. Shiyu Chang (120 papers)
  4. Yufei Feng (18 papers)
  5. Li Zhang (693 papers)
  6. Hui Su (38 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.