NAMER: A Node-Based Multitasking Framework for Multi-Hop Knowledge Base Question Answering
We present NAMER, an open-domain Chinese knowledge base question answering system based on a novel node-based framework that better grasps the structural mapping between questions and KB queries by aligning the nodes in a query with their corresponding mentions in question. Equipped with techniques including data augmentation and multitasking, we show that the proposed framework outperforms the previous SoTA on CCKS CKBQA dataset. Moreover, we develop a novel data annotation strategy that facilitates the node-to-mention alignment, a dataset (https://github.com/ridiculouz/CKBQA) with such strategy is also published to promote further research. An online demo of NAMER (http://kbqademo.gstore.cn) is provided to visualize our framework and supply extra information for users, a video illustration (https://youtu.be/yetnVye{\_}hg4) of NAMER is also available.
Code (0)
등록된 구현이 없습니다.
Tasks
Data AugmentationKnowledge Base Question AnsweringQuestion AnsweringSimilar Papers 제목 키워드 기반
NAMER: Non-Autoregressive Modeling for Handwritten Mathematical Expression Recognition
Recently, Handwritten Mathematical Expression Recognition (HMER) has gained considerable attention in pattern recognition for its diverse applications in document understanding. Current methods typically approach HMER as…
Decoderdocument understandingHandwritten Mathmatical Expression RecognitionA Coevolutionary Variable Neighborhood Search Algorithm for Discrete Multitasking (CoVNS): Application to Community Detection over Graphs
The main goal of the multitasking optimization paradigm is to solve multiple and concurrent optimization tasks in a simultaneous way through a single search process. For attaining promising results, potential complementa…
Community DetectionOn the Transferability of Knowledge among Vehicle Routing Problems by using Cellular Evolutionary Multitasking
Multitasking optimization is a recently introduced paradigm, focused on the simultaneous solving of multiple optimization problem instances (tasks). The goal of multitasking environments is to dynamically exploit existin…
COEBA: A Coevolutionary Bat Algorithm for Discrete Evolutionary Multitasking
Multitasking optimization is an emerging research field which has attracted lot of attention in the scientific community. The main purpose of this paradigm is how to solve multiple optimization problems or tasks simultan…
Traveling Salesman ProblemMultitasking Evolutionary Algorithm Based on Adaptive Seed Transfer for Combinatorial Problem
Evolutionary computing (EC) is widely used in dealing with combinatorial optimization problems (COP). Traditional EC methods can only solve a single task in a single run, while real-life scenarios often need to solve mul…
Combinatorial OptimizationTransfer Learning