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

7Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.
Get full text

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 grammaticality 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.

Cite

CITATION STYLE

APA

Pontes, E. L., Huet, S., da Silva, T. G., Torres-Moreno, J. M., & Linhares, A. C. (2018). Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming. In NAACL HLT 2018 - Graph-Based Methods for Natural Language Processing, TextGraphs 2018 - Proceedings of the 12th Workshop (pp. 18–27). Association for Computational Linguistics. https://doi.org/10.18653/v1/w18-1704

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free