检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张雪松 李冠君[2] 聂士佳 张大伟 吕钊[1] 陶建华[3] ZHANG Xue-song;LI Guan-jun;NIE Shi-jia;ZHANG Da-wei;LYU Zhao;TAO Jian-hua(School of Computer Science and Technology,Anhui University,Hefei 230601,China;State Key Laboratory of Pattern Recognition,Institute of Automation,Chinese Academy of Sciences,Beijing 100190,China;Department of Automation,Tsinghua University,Beijing 100084,China)
机构地区:[1]安徽大学计算机科学与技术学院,安徽合肥230601 [2]中国科学院自动化研究所模式识别国家重点实验室,北京100190 [3]清华大学自动化系,北京100084
出 处:《计算机技术与发展》2024年第1期121-127,共7页Computer Technology and Development
基 金:国家重点研发计划(2020AAA0140003);浙江实验室开放研究项目(2021KH0AB06);北京市科委、中关村管委会计划(Z211100004821013)。
摘 要:多跳问答旨在通过对多篇文档内容进行推理,来预测问题答案以及针对答案的支撑事实。然而当前的多跳问答方法在文档筛选任务中旨在找到与问题相关的所有文档,未考虑到这些文档是否都对找到答案有所帮助。因此,该文提出一种两阶段的文档筛选方法。第一阶段通过对文档进行评分且设置较小的阈值来获取尽可能多的与问题相关文档,保证文档的高召回率;第二阶段对问题答案的推理路径进行建模,在第一阶段的基础上再次提取文档,保证文档的高精确率。此外,针对由文档构成的多粒度图,提出一种新颖的异步更新机制来进行答案预测以及支撑事实预测。提出的异步更新机制将多粒度图分为异质图和同质图来进行异步更新以更好地进行多跳推理。该方法在性能上优于目前主流的多跳问答方法,验证了该方法的有效性。Multi-hop question answering aims to predict the answer to a question and the supporting facts for the answer by reasoning over the content of multiple documents.However,current multi-hop question answering methods aim to find all documents related to the question in the document filtering task,without considering whether all these documents are useful for finding the answer.Therefore,we propose a two-stage document filtering approach.In the first stage,the documents are scored and a small threshold is set to obtain as many relevant documents as possible to ensure a high recall of documents.In the second stage,the inference path of the question answer is modeled,and the documents are extracted again based on the first stage to ensure high accuracy.In addition,we propose a novel asynchronous update mechanism for answer prediction and supporting fact prediction for multi-granularity graph composed of documents.The proposed asynchronous update mechanism divides the multi-grain graph into heterogeneous and homogeneous graphs to perform asynchronous updates for better multi-hop inference.The performance of the proposed method is better than that of the current mainstream multi hop question answering method,and the effectiveness of the proposed method is verified.
关 键 词:多跳问答 文档筛选 多粒度图 异步更新 答案预测
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200