Retrieving textual evidence for knowledge graph facts

Autor: Ercan, Gonenc, Elbassuoni, Shady, Hose, Katja
Přispěvatelé: Janowicz, Krzysztof, Haller, Armin, Zaveri, Amrapali, Gray, Alasdair J.G., Hitzler, Pascal, Hammar, Karl, Lopez, Vanessa, Fernández, Miriam
Jazyk: angličtina
Rok vydání: 2019
Zdroj: Ercan, G, Elbassuoni, S & Hose, K 2019, Retrieving textual evidence for knowledge graph facts . in K Janowicz, A Haller, A Zaveri, A J G Gray, P Hitzler, K Hammar, V Lopez & M Fernández (eds), The Semantic Web . Springer, Portorož, Slovenia, Lecture Notes in Computer Science, vol. 11503, pp. 52-67, 16th International Semantic Web Conference, ESWC 2019, Portorož, Slovenia, 02/06/2019 . https://doi.org/10.1007/978-3-030-21348-0_4
DOI: 10.1007/978-3-030-21348-0_4
Popis: Knowledge graphs have become vital resources for semantic search and provide users with precise answers to their information needs. Knowledge graphs often consist of billions of facts, typically encoded in the form of RDF triples. In most cases, these facts are extracted automatically and can thus be susceptible to errors. For many applications, it can therefore be very useful to complement knowledge graph facts with textual evidence. For instance, it can help users make informed decisions about the validity of the facts that are returned as part of an answer to a query. In this paper, we therefore propose, an approach that given a knowledge graph and a text corpus, retrieves the top-k most relevant textual passages for a given set of facts. Since our goal is to retrieve short passages, we develop a set of IR models combining exact matching through the Okapi BM25 model with semantic matching using word embeddings. To evaluate our approach, we built an extensive benchmark consisting of facts extracted from YAGO and text passages retrieved from Wikipedia. Our experimental results demonstrate the effectiveness of our approach in retrieving textual evidence for knowledge graph facts.
Databáze: OpenAIRE