KBPearl
Authors:
Open Access
- 26 March 2020
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 13 (7) , 1035-1049
Abstract
Nowadays, most openly available knowledge bases (KBs) are incomplete, since they are not synchronized with the emerging facts happening in the real world. Therefore, knowledge base population (KBP) from external data sources, which extracts knowledge from unstructured text to populate KBs, becomes a vital task. Recent research proposes two types of solutions that partially address this problem, but the performance of these solutions is limited. The first solution, dynamic KB construction from unstructured text, requires specifications of which predicates are of interest to the KB, which needs preliminary setups and is not suitable for an in-time population scenario. The second solution, Open Information Extraction (Open IE) from unstructured text, has limitations in producing facts that can be directly linked to the target KB without redundancy and ambiguity. In this paper, we present an end-to-end system, KBPearl, for KBP, which takes an incomplete KB and a large corpus of text as input, to (1) organize the noisy extraction from Open IE into canonicalized facts; and (2) populate the KB by joint entity and relation linking, utilizing the context knowledge of the facts and the side information inferred from the source text. We demonstrate the effectiveness and efficiency of KBPearl against the state-of-the-art techniques, through extensive experiments on real-world datasets.Keywords
This publication has 36 references indexed in Scilit:
- Incremental knowledge base construction using DeepDiveProceedings of the VLDB Endowment, 2015
- Leveraging Linguistic Structure For Open Domain Information Extraction2015
- A Bayesian Mixed Effects Model of Literary Character2014
- The Stanford CoreNLP Natural Language Processing Toolkit2014
- Overlapping community detection in networksACM Computing Surveys, 2013
- Entity Recommendations in Web Search2013
- Finding Dense Subgraphs with Size Bounds2009
- DBpedia: A Nucleus for a Web of Open Data2007
- NLTK2002
- WordNetCommunications of the ACM, 1995