arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.05938cs.CL
收藏

QMSum:一种新的基于查询的多域会议摘要基准

QMSum: A New Benchmark for Query-based Multi-domain Meeting Summarization

Fudan University(复旦大学);University of California, Los Angeles(加利福尼亚大学洛杉矶分校);Yale University(耶鲁大学);Microsoft Research(微软研究院);Microsoft Cognitive Services Research(微软认知服务研究院)

Ming Zhong, Da Yin, Tao Yu, Ahmad Zaidi, Mutethia Mutuma, Rahul Jha, Ahmed Hassan Awadallah, Asli Celikyilmaz, Yang Liu, Xipeng Qiu, Dragomir Radev

摘要:

会议是人类协作的关键组成部分。随着越来越多的会议被记录和转录,会议摘要变得至关重要,可以提醒那些可能参加或可能没有参加会议的人关于所作的关键决定和有待完成的任务。然而,很难创建一个简短的摘要,涵盖涉及多个人和主题的长时间会议的所有内容。为了满足不同类型用户的需求,我们定义了一个新的基于查询的多域会议摘要任务,其中模型必须选择和总结相关的会议跨度,以响应查询,我们引入了QMSum,一个新的基准此任务。QMSum由多个领域的232个会议上的1,808个查询摘要对组成。此外,我们研究了一个定位然后总结的方法,并评估了一组强大的摘要基线的任务。实验结果和手动分析表明,QMSum提出了重大挑战,在长时间会议摘要为未来的研究。数据集可在\url{https://github.com/Yale-LILY/QMSum}上获得。

英文摘要:

Meetings are a key component of human collaboration. As increasing numbers of meetings are recorded and transcribed, meeting summaries have become essential to remind those who may or may not have attended the meetings about the key decisions made and the tasks to be completed. However, it is hard to create a single short summary that covers all the content of a long meeting involving multiple people and topics. In order to satisfy the needs of different types of users, we define a new query-based multi-domain meeting summarization task, where models have to select and summarize relevant spans of meetings in response to a query, and we introduce QMSum, a new benchmark for this task. QMSum consists of 1,808 query-summary pairs over 232 meetings in multiple domains. Besides, we investigate a locate-then-summarize method and evaluate a set of strong summarization baselines on the task. Experimental results and manual analysis reveal that QMSum presents significant challenges in long meeting summarization for future research. Dataset is available at \url{https://github.com/Yale-LILY/QMSum}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑