Question Answering over Knowledge Graphs with Neural Machine Translation and Entity Linking
원문 초록
The goal of Question Answering over Knowledge Graphs (KGQA) is to find answers for natural language questions over a knowledge graph. Recent KGQA approaches adopt a neural machine translation (NMT) approach, where the natural language question is translated into a structured query language. However, NMT suffers from the out-of-vocabulary problem, where terms in a question may not have been seen during training, impeding their translation. This issue is particularly problematic for the millions of entities that large knowledge graphs describe. We rather propose a KGQA approach that delegates the processing of entities to entity linking (EL) systems. NMT is then used to create a query template with placeholders that are filled by entities identified in an EL phase. Slot filling is used to decide which entity fills which placeholder. Experiments for QA over Wikidata show that our approach outperforms pure NMT: while there remains a strong dependence on having seen similar query templates during training, errors relating to entities are greatly reduced.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering
Enhancing Paraphrase Type Generation: The Impact of DPO and RLHF Evaluated with Human-Ranked Data
Inference Scaled GraphRAG: Improving Multi Hop Question Answering on Knowledge Graphs
Semantic similarity estimation for domain specific data using BERT and other techniques
ConECT Dataset: Overcoming Data Scarcity in Context-Aware E-Commerce MT
iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.