Towards a language-independent solution: Knowledge base completion by searching the Web and deriving language pattern

被引:1
作者
Bing, Lidong [1 ,4 ]
Zhang, Zhiming [2 ]
Lam, Wai [3 ]
Cohen, William W. [4 ]
机构
[1] Tencent Inc, AI Platform Dept, Shenzhen, Peoples R China
[2] Baidu Inc, Web Data Min Dept, Shenzhen, Peoples R China
[3] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China
[4] Carnegie Mellon Univ, Machine Learning Dept, Pittsburgh, PA 15213 USA
关键词
Knowledge base completion; Language pattern; Language-independent solution;
D O I
10.1016/j.knosys.2016.10.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Knowledge bases (KBs) such as Freebase and Yago are rather incomplete, and the situation is more serious in non-English KBs, such as Chinese KBs. In this paper, we present a language-independent framework to tackle the slot-filling task by searching the Web with high-precision queries, and deriving lightweight extraction patterns. The patterns are based on string matching, and since they make no use of complex NLP resources, which may be unavailable in some languages, they are very language-independent. We use a traditional bootstrapping approach for extraction, but also use a novel approach to suppress the noise associated with distant supervision: in particular, we use a pseudo-testing method to validate the patterns derived from different sentences. Experiments show that our framework achieves very encouraging results. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:80 / 86
页数:7
相关论文
共 43 条
  • [1] Agichtein E., 2000, ACM 2000. Digital Libraries. Proceedings of the Fifth ACM Conference on Digital Libraries, P85, DOI 10.1145/336597.336644
  • [2] AKBC '13, 2013, AKBC 13 P 2013 WORKS
  • [3] [Anonymous], 2007, P 16 ACM C INF KNOWL, DOI DOI 10.1145/1321440.1321449
  • [4] [Anonymous], 1992, COLING 1992, DOI DOI 10.3115/992133.992154
  • [5] [Anonymous], 2005, P HUM LANG TECHN C C
  • [6] [Anonymous], 2011, EMNLP 11 PROC C EMPI
  • [7] [Anonymous], 2010, Toward an Architecture for Never-Ending Language Learning
  • [8] [Anonymous], 2004, WWW '04, DOI DOI 10.1145/988672.988687
  • [9] [Anonymous], 2011, P 22 INT JOINT C ART
  • [10] [Anonymous], 2008, P 46THANNUALMEETING