Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming

Abstract

Multi-Sentence Compression (MSC) aims to generate a short sentence with key information from a cluster of closely related sentences. MSC enables summarization and question-answering systems to generate outputs combining fully formed sentences from one or several documents. This paper describes a new Integer Linear Programming method for MSC using a vertex-labeled graph to select different keywords, and novel 3-grams scores to generate more informative sentences while maintaining their grammaticality. Our system is of good quality and outperforms the state-of-the-art for evaluations led on news dataset. We led both automatic and manual evaluations to determine the informativeness and the gram-maticality of compressions for each dataset. Additional tests, which take advantage of the fact that the length of compressions can be modulated, still improve ROUGE scores with shorter output sentences.
Fichier principal
Vignette du fichier
TextGraphs_2018.pdf (210.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01779470 , version 1 (26-04-2018)

Identifiers

Cite

Elvys Linhares Pontes, Stéphane Huet, Thiago Gouveia da Silva, Juan-Manuel Torres-Moreno, Andréa Carneiro Linhares. Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming. NAACL-HLT 12th Workshop on Graph-based Methods for Natural Language Processing (TextGraphs), 2018, New Orleans, LA, United States. ⟨10.18653/v1/W18-1704⟩. ⟨hal-01779470⟩

Collections

UNIV-AVIGNON LIA
147 View
166 Download

Altmetric

Share

Gmail Facebook X LinkedIn More