Collecting supporting evidence from large corpora of text (e.g., Wikipedia) is of great challenge for open-domain Question Answering (QA). Especially, for multi-hop open-domain QA, scattered evidence pieces are required to be gathered together to support the answer extraction. In this paper, we propose a new retrieval target, hop, to collect the hidden reasoning evidence from Wikipedia for complex question answering. Specifically, the hop in this paper is defined as the combination of a hyperlink and the corresponding outbound link document. The hyperlink is encoded as the mention embedding which models the structured knowledge of how the outbound link entity is mentioned in the textual context, and the corresponding outbound link document is encoded as the document embedding representing the unstructured knowledge within it. Accordingly, we build HopRetriever which retrieves hops over Wikipedia to answer complex questions. Experiments on the HotpotQA dataset demonstrate that HopRetriever outperforms previously published evidence retrieval methods by large margins. Moreover, our approach also yields quantifiable interpretations of the evidence collection process.
翻译:从大文本公司(例如维基百科)收集辅助证据对开放域名问答(QA)来说是一项巨大的挑战。特别是,对于多跳开放域名 QA 来说,需要收集分散的证据,以支持解答提取。在本文中,我们提议一个新的检索目标,跳,从维基百科收集隐藏的推理证据,以回答复杂的问题。具体地说,本文中的跳点被定义为超链接和相应的外部链接文件的组合。超链接被编码为包含哪些模型的链接实体的结构知识在文本背景下被提及,相应的外部链接文件被编码为嵌入文件,以内嵌入代表非结构性知识的文件。因此,我们建造Hopretriever,从维基百科上检索,以回答复杂的问题。HotpotQA数据集实验显示Hopretriever在很大的范围内超越了以前公布的证据检索方法。此外,我们的方法还得出了证据收集过程的可量化的解释。