首页 | 本学科首页   官方微博 | 高级检索  
     

基于BiLSTM-CRF的细粒度知识图谱问答
引用本文:张楚婷,常亮,王文凯,陈红亮,宾辰忠.基于BiLSTM-CRF的细粒度知识图谱问答[J].计算机工程,2020,46(2):41-47.
作者姓名:张楚婷  常亮  王文凯  陈红亮  宾辰忠
作者单位:桂林电子科技大学广西可信软件重点实验室,广西桂林541004;桂林电子科技大学卫星导航定位与位置服务国家地方联合工程研究中心,广西桂林541004
基金项目:国家科技重大专项;国家自然科学基金
摘    要:基于知识图谱的问答中问句侯选主实体筛选步骤繁琐,且现有多数模型忽略了问句与关系的细粒度相关性。针对该问题,构建基于BiLSTM-CRF的细粒度知识图谱问答模型,其中包括实体识别和关系预测2个部分。在实体识别部分,利用BiLSTM-CRF模型提高准确性,并将N-Gram算法与Levenshtein距离算法相结合用于候选主实体的筛选,简化候选主实体筛选过程。在关系预测部分,分别应用注意力机制和卷积神经网络从语义层次和词层次捕获问句与关系之间的相互联系。使用FreeBase中的FB2M和FB5M评估数据集进行实验,结果表明,与针对单一关系的问答方法相比,该模型对于实体关系对的预测准确率更高。

关 键 词:实体识别  关系预测  知识图谱  卷积神经网络  问答模型  N-Gram算法

Fine-grained Question Answering over Knowledge Graph Based on BiLSTM-CRF
ZHANG Chuting,CHANG Liang,WANG Wenkai,CHEN Hongliang,BIN Chenzhong.Fine-grained Question Answering over Knowledge Graph Based on BiLSTM-CRF[J].Computer Engineering,2020,46(2):41-47.
Authors:ZHANG Chuting  CHANG Liang  WANG Wenkai  CHEN Hongliang  BIN Chenzhong
Affiliation:(Guangxi Key Laboratory of Trusted Software,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China;National-Local Joint Engineering Research Center for Satellite Navigation Positioning and Location Service,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China)
Abstract:Question answering over knowledge graph is complex in the filtering of candidate master entities of questions,and most existing models ignore the fine-grained correlation between questions and relationships.To address the problem,this paper proposes a fine-grained question answering model over knowledge graph based on BiLSTM-CRF.The model is divided into two parts:entity recognition and relationship prediction.In the entity recognition part,the model uses the BiLSTM-CRF algorithm to improve accuracy,and the N-Gram algorithm is combined with the Levenshtein Distance algorithm to simplify the filtering process of candidate master entities.In the relationship prediction part,attention mechanism and Convolutional Neural Network(CNN)are used to capture the correlation between questions and relationships at the semantic level and the word level.Experimental results on the FB2M and FB5M evaluation datasets in FreeBase show that the proposed model has higher accuracy of entity relationship pair prediction compared with existing question answering methods for a single relationship.
Keywords:entity recognition  relation prediction  knowledge graph  Convolutional Neural Network(CNN)  question answering model  N-Gram algorithm
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号