Abstract
Relation linking is an important problem for knowledge graph-based Question Answering. Given a natural language question and a knowledge graph, the task is to identify relevant relations from the given knowledge graph. Since existing techniques for entity extraction and linking are more stable compared to relation linking, our idea is to exploit entities extracted from the question to support relation linking. In this paper, we propose a novel approach, based on DBpedia entities, for computing relation candidates. We have empirically evaluated our approach on different standard benchmarks. Our evaluation shows that our approach significantly outperforms existing baseline systems in both recall, precision and runtime.
Original language | English |
---|---|
Title of host publication | The Semantic Web |
Subtitle of host publication | ISWC 2019 |
Editors | Chiara Ghidini, Olaf Hartig, Maria Maleshkova, Vojtech Svátek, Isabel Cruz, Aidan Hogan, Jie Song, Maxime Lefrançois, Fabien Gandon |
Publisher | Springer |
Pages | 523-538 |
Number of pages | 16 |
ISBN (Electronic) | 9783030307936 |
ISBN (Print) | 9783030307929 |
DOIs | |
Publication status | Published - 2019 |
Event | International Semantic Web Conference 2019 - The University of Auckland, Auckland, New Zealand Duration: 26 Oct 2019 → 30 Oct 2019 Conference number: 18 https://link.springer.com/book/10.1007/978-3-030-30793-6 https://iswc2019.semanticweb.org/ |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 11778 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | International Semantic Web Conference 2019 |
---|---|
Abbreviated title | ISWC 2019 |
Country/Territory | New Zealand |
City | Auckland |
Period | 26/10/19 → 30/10/19 |
Internet address |
Keywords
- Knowledge Graph
- Predicate linking
- Question answering
- Semantic search
- Semantic Web