Using the summary graph topology and the features defined above we express the abstract Web summarization task as a structured learning problem.
we seek to obtain edge weights such that the cost of individual reference summaries -which, as we saw earlier, are mapped to paths -is minimized.