@InProceedings{linharespontes-EtAl:2018:W18-17,
  author    = {Linhares Pontes, Elvys  and  Huet, Stéphane  and  Gouveia da Silva, Thiago  and  Linhares, Andréa carneiro  and  Torres-Moreno, Juan-Manuel},
  title     = {Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming},
  booktitle = {Proceedings of the Twelfth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-12)},
  month     = {June},
  year      = {2018},
  address   = {New Orleans, Louisiana, USA},
  publisher = {Association for Computational Linguistics},
  pages     = {18--27},
  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-gram 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. Author{4}{Affiliation}},
  url       = {http://www.aclweb.org/anthology/W18-1704}
}