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.
- Xiangyang Mou (8 papers)
- Mo Yu (117 papers)
- Shiyu Chang (120 papers)
- Yufei Feng (18 papers)
- Li Zhang (693 papers)
- Hui Su (38 papers)