CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Extractive summarization by aggregating multiple similarities

Olof Mogren (Institutionen för data- och informationsteknik, Datavetenskap, Algoritmer (Chalmers)) ; Mikael Kågebäck (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Devdatt Dubhashi (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
International Conference Recent Advances in Natural Language Processing, RANLP (1313-8502). Vol. 2015 (2015), p. 451-457.
[Konferensbidrag, refereegranskat]

News reports, social media streams, blogs, digitized archives and books are part of a plethora of reading sources that people face every day. This raises the question of how to best generate automatic summaries. Many existing methods for extracting summaries rely on comparing the similarity of two sentences in some way. We present new ways of measuring this similarity, based on sentiment analysis and continuous vector space representations, and show that combining these together with similarity measures from existing methods, helps to create better summaries. The finding is demonstrated with MULTSUM, a novel summarization method that uses ideas from kernel methods to combine sentence similarity measures. Submodular optimization is then used to produce summaries that take several different similarity measures into account. Our method improves over the state-of-the-art on standard benchmark datasets; it is also fast and scale to large document collections, and the results are statistically significant.

Denna post skapades 2016-01-05.
CPL Pubid: 229759