Unsupervised Extractive Dialogue Summarization in Hyperdimensional Space

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Park, Seongmin, Kim, Kyungho, Seo, Jaejin, Lee, Jihwa
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911878315245568
author Park, Seongmin
Kim, Kyungho
Seo, Jaejin
Lee, Jihwa
author_facet Park, Seongmin
Kim, Kyungho
Seo, Jaejin
Lee, Jihwa
contents We present HyperSum, an extractive summarization framework that captures both the efficiency of traditional lexical summarization and the accuracy of contemporary neural approaches. HyperSum exploits the pseudo-orthogonality that emerges when randomly initializing vectors at extremely high dimensions ("blessing of dimensionality") to construct representative and efficient sentence embeddings. Simply clustering the obtained embeddings and extracting their medoids yields competitive summaries. HyperSum often outperforms state-of-the-art summarizers -- in terms of both summary accuracy and faithfulness -- while being 10 to 100 times faster. We open-source HyperSum as a strong baseline for unsupervised extractive summarization.
format Preprint
id arxiv_https___arxiv_org_abs_2405_09765
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Unsupervised Extractive Dialogue Summarization in Hyperdimensional Space
Park, Seongmin
Kim, Kyungho
Seo, Jaejin
Lee, Jihwa
Computation and Language
Artificial Intelligence
We present HyperSum, an extractive summarization framework that captures both the efficiency of traditional lexical summarization and the accuracy of contemporary neural approaches. HyperSum exploits the pseudo-orthogonality that emerges when randomly initializing vectors at extremely high dimensions ("blessing of dimensionality") to construct representative and efficient sentence embeddings. Simply clustering the obtained embeddings and extracting their medoids yields competitive summaries. HyperSum often outperforms state-of-the-art summarizers -- in terms of both summary accuracy and faithfulness -- while being 10 to 100 times faster. We open-source HyperSum as a strong baseline for unsupervised extractive summarization.
title Unsupervised Extractive Dialogue Summarization in Hyperdimensional Space
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2405.09765