A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings
2020
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics
unpublished
Knowledge Graphs (KG) are multi-relational graphs consisting of entities as nodes and relations among them as typed edges. Goal of the Question Answering over KG (KGQA) task is to answer natural language queries posed over the KG. Multi-hop KGQA requires reasoning over multiple edges of the KG to arrive at the right answer. KGs are often incomplete with many missing links, posing additional challenges for KGQA, especially for multi-hop KGQA. Recent research on multihop KGQA has attempted to
doi:10.18653/v1/2020.acl-main.412
fatcat:h3ndz7gjabfq5agkjf435mdmna