TextGraphs 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration

Peter Alexander Jansen, Dmitry Ustalov
{"title":"TextGraphs 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration","authors":"Peter Alexander Jansen, Dmitry Ustalov","doi":"10.18653/v1/2020.textgraphs-1.10","DOIUrl":null,"url":null,"abstract":"The 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration tasks participants with regenerating large detailed multi-fact explanations for standardized science exam questions. Given a question, correct answer, and knowledge base, models must rank each fact in the knowledge base such that facts most likely to appear in the explanation are ranked highest. Explanations consist of an average of 6 (and as many as 16) facts that span both core scientific knowledge and world knowledge, and form an explicit lexically-connected “explanation graph” describing how the facts interrelate. In this second iteration of the explanation regeneration shared task, participants are supplied with more than double the training and evaluation data of the first shared task, as well as a knowledge base nearly double in size, both of which expand into more challenging scientific topics that increase the difficulty of the task. In total 10 teams participated, and 5 teams submitted system description papers. The best-performing teams significantly increased state-of-the-art performance both in terms of ranking (mean average precision) and inference speed on this challenge task.","PeriodicalId":282839,"journal":{"name":"Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Graph-based Methods for Natural Language Processing (TextGraphs)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/2020.textgraphs-1.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

The 2020 Shared Task on Multi-Hop Inference for Explanation Regeneration tasks participants with regenerating large detailed multi-fact explanations for standardized science exam questions. Given a question, correct answer, and knowledge base, models must rank each fact in the knowledge base such that facts most likely to appear in the explanation are ranked highest. Explanations consist of an average of 6 (and as many as 16) facts that span both core scientific knowledge and world knowledge, and form an explicit lexically-connected “explanation graph” describing how the facts interrelate. In this second iteration of the explanation regeneration shared task, participants are supplied with more than double the training and evaluation data of the first shared task, as well as a knowledge base nearly double in size, both of which expand into more challenging scientific topics that increase the difficulty of the task. In total 10 teams participated, and 5 teams submitted system description papers. The best-performing teams significantly increased state-of-the-art performance both in terms of ranking (mean average precision) and inference speed on this challenge task.
TextGraphs 2020多跳推理解释再生共享任务
2020年多跳推理解释再生共享任务要求参与者为标准化科学考试问题再生大量详细的多事实解释。给定一个问题、正确答案和知识库,模型必须对知识库中的每个事实进行排序,使最有可能出现在解释中的事实排名最高。解释由平均6个(最多16个)事实组成,这些事实跨越核心科学知识和世界知识,并形成一个明确的词汇连接的“解释图”,描述事实如何相互关联。在解释再生共享任务的第二次迭代中,为参与者提供了比第一次共享任务多一倍以上的训练和评估数据,以及几乎两倍大小的知识库,这两者都扩展到更具挑战性的科学主题,从而增加了任务的难度。共有10个团队参与,其中5个团队提交了系统描述论文。在这个挑战任务中,表现最好的团队在排名(平均精度)和推理速度方面都显著提高了最先进的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信