PNEL: Pointer Network based End-To-End Entity Linking over Knowledge Graphs
원문 초록
Question Answering systems are generally modelled as a pipeline consisting of a sequence of steps. In such a pipeline, Entity Linking (EL) is often the first step. Several EL models first perform span detection and then entity disambiguation. In such models errors from the span detection phase cascade to later steps and result in a drop of overall accuracy. Moreover, lack of gold entity spans in training data is a limiting factor for span detector training. Hence the movement towards end-to-end EL models began where no separate span detection step is involved. In this work we present a novel approach to end-to-end EL by applying the popular Pointer Network model, which achieves competitive performance. We demonstrate this in our evaluation over three datasets on the Wikidata Knowledge Graph.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering
Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunities
Inference Scaled GraphRAG: Improving Multi Hop Question Answering on Knowledge Graphs
iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering
DGRAG: Distributed Graph-based Retrieval-Augmented Generation in Edge-Cloud Systems
DO-RAG: A Domain-Specific QA Framework Using Knowledge Graph-Enhanced Retrieval-Augmented Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.