Learning to Summarise Related Sentences

  title={Learning to Summarise Related Sentences},
  author={Emmanouil Tzouridis and Jamal A. Nasir and Ulf Brefeld},
We cast multi-sentence compression as a structured prediction problem. Related sentences are represented by a word graph so that summaries constitute paths in the graph (Filippova, 2010). We devise a parameterised shortest path algorithm that can be written as a generalised linear model in a joint space of word graphs and compressions. We use a large-margin approach to adapt parameterised edge weights to the data such that the shortest path is identical to the desired summary. Decoding during… CONTINUE READING