pith. sign in

arxiv: 2005.01619 · v2 · pith:4XDHUE7Mnew · submitted 2020-05-04 · 💻 cs.CL

From Arguments to Key Points: Towards Automatic Argument Summarization

classification 💻 cs.CL
keywords pointsargumentsdatasetlargesmalltasktopicaccording
0
0 comments X
read the original abstract

Generating a concise summary from a large collection of arguments on a given topic is an intriguing yet understudied problem. We propose to represent such summaries as a small set of talking points, termed "key points", each scored according to its salience. We show, by analyzing a large dataset of crowd-contributed arguments, that a small number of key points per topic is typically sufficient for covering the vast majority of the arguments. Furthermore, we found that a domain expert can often predict these key points in advance. We study the task of argument-to-key point mapping, and introduce a novel large-scale dataset for this task. We report empirical results for an extensive set of experiments with this dataset, showing promising performance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Community-Based Approach for Stance Distribution and Argument Organization

    cs.CL 2026-04 unverdicted novelty 4.0

    Unsupervised graph community detection organizes arguments to reveal stance distributions in debates.