SOTAVerified

Fast Concept Mention Grouping for Concept Map-based Multi-Document Summarization

2019-06-01NAACL 2019Code Available0· sign in to hype

Tobias Falke, Iryna Gurevych

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Concept map-based multi-document summarization has recently been proposed as a variant of the traditional summarization task with graph-structured summaries. As shown by previous work, the grouping of coreferent concept mentions across documents is a crucial subtask of it. However, while the current state-of-the-art method suggested a new grouping method that was shown to improve the summary quality, its use of pairwise comparisons leads to polynomial runtime complexity that prohibits the application to large document collections. In this paper, we propose two alternative grouping techniques based on locality sensitive hashing, approximate nearest neighbor search and a fast clustering algorithm. They exhibit linear and log-linear runtime complexity, making them much more scalable. We report experimental results that confirm the improved runtime behavior while also showing that the quality of the summary concept maps remains comparable.

Tasks

Reproductions