Open Question Answering Over Curated and Extracted Knowledge Bases

被引:191
作者
Fader, Anthony [1 ]
Zettlemoyer, Luke [2 ]
Etzioni, Oren [1 ]
机构
[1] Allen Inst AI, Seattle, WA 98103 USA
[2] Univ Washington, Seattle, WA 98195 USA
来源
PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14) | 2014年
关键词
D O I
10.1145/2623330.2623677
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider the problem of open-domain question answering (Open QA) over massive knowledge bases (KBs). Existing approaches use either manually curated KBs like Freebase or KBs automatically extracted from unstructured text. In this paper, we present OQA, the first approach to leverage both curated and extracted KBs. A key technical challenge is designing systems that are robust to the high variability in both natural language questions and massive KBs. OQA achieves robustness by decomposing the full Open QA problem into smaller sub-problems including question paraphrasing and query reformulation. OQA solves these sub-problems by mining millions of rules from an unlabeled question corpus and across multiple KBs. OQA then learns to integrate these rules by performing discriminative training on question-answer pairs using a latent-variable structured perceptron algorithm. We evaluate OQA on three benchmark question sets and demonstrate that it achieves up to twice the precision and recall of a state-of-the-art Open QA system.
引用
收藏
页码:1156 / 1165
页数:10
相关论文
共 31 条
[1]  
[Anonymous], 2005, UAI
[2]  
[Anonymous], 2011, ACL
[3]  
[Anonymous], 2013, EMNLP
[4]  
[Anonymous], 1997, P RIAO
[5]  
[Anonymous], 2010, AAAI
[6]  
[Anonymous], 2009, JOINT C M ACL INT JO
[7]  
[Anonymous], 2013, P ACL
[8]  
[Anonymous], 1977, STOC
[9]  
Banko M., 2002, 2002 AAAI SPRING S M
[10]  
Banko M, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2670