{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/qmsum-a-new-benchmark-for-query-based-multi","title":"QMSum: A New Benchmark for Query-based Multi-domain Meeting Summarization","arxiv_id":"2104.05938","date":"2021-04-13","proceeding":"NAACL 2021 4","authors":["Ming Zhong","Da Yin","Tao Yu","Ahmad Zaidi","Mutethia Mutuma","Rahul Jha","Ahmed Hassan Awadallah","Asli Celikyilmaz","Yang Liu","Xipeng Qiu","Dragomir Radev"],"abstract":"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}.","url_abs":"https://arxiv.org/abs/2104.05938v1","url_pdf":"https://arxiv.org/pdf/2104.05938v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"qmsum-a-new-benchmark-for-query-based-multi","repo_url":"https://github.com/Yale-LILY/QMSum","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"meeting-summarization","task_name":"Meeting Summarization"}],"methods":[],"datasets_introduced":[{"slug":"qmsum","name":"QMSum","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2104.05938","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}