arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.07043cs.AIcs.CLcs.LG
收藏

基于开放谓词关系的虚拟知识库推理

Reasoning Over Virtual Knowledge Bases With Open Predicate Relations

Carnegie Mellon University(卡内基梅隆大学);Google Research(谷歌研究院)

Haitian Sun, Pat Verga, Bhuwan Dhingra, Ruslan Salakhutdinov, William W. Cohen

摘要:

我们提出了开放谓词查询语言(OPQL),一种方法,用于构建一个虚拟知识库(VKB)完全从文本训练。大型知识库(KBs)对于诸如问答和推荐等广泛的行业应用是不可或缺的。通常,知识库以一种结构化的、易于访问的形式对世界知识进行编码,这种形式来自于费力的人类注释工作。不幸的是,虽然它们具有极高的精度,但知识库不可避免地高度不完整,并且用于丰富它们的自动化方法太不准确。相反,OPQL通过对一组关系提及进行编码和索引来构建VKB,这种方式可以自然地进行推理,并且可以在没有任何结构化监督的情况下进行训练。我们证明,OPQL优于以前的VKB方法在两个不同的知识库推理任务,此外,可以作为一个外部存储器集成到一个语言模型(OPQL-LM)导致两个开放域的问答任务的改进。

英文摘要:

We present the Open Predicate Query Language (OPQL); a method for constructing a virtual KB (VKB) trained entirely from text. Large Knowledge Bases (KBs) are indispensable for a wide-range of industry applications such as question answering and recommendation. Typically, KBs encode world knowledge in a structured, readily accessible form derived from laborious human annotation efforts. Unfortunately, while they are extremely high precision, KBs are inevitably highly incomplete and automated methods for enriching them are far too inaccurate. Instead, OPQL constructs a VKB by encoding and indexing a set of relation mentions in a way that naturally enables reasoning and can be trained without any structured supervision. We demonstrate that OPQL outperforms prior VKB methods on two different KB reasoning tasks and, additionally, can be used as an external memory integrated into a language model (OPQL-LM) leading to improvements on two open-domain question answering tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑