After calculating the raw score of each sentence , we use a modified version of the Adaptive Greedy Algorithm by Filatova and Hatzivassiloglou ( 2004 ) to penalize redundant sentences in cohesive clusters .
eventbased extractive summarization
E Filatova V Hatzivassiloglou
Removing redundant sentences . After calculating the raw score of each sentence , we use a modified version of the Adaptive Greedy Algorithm by Filatova and Hatzivassiloglou ( 2004 ) to penalize redundant sentences in cohesive clusters . This is done by decrementing the score of a sentence that belongs to an SC for which there is a higher or equal scoring sentence ( if there are several highest-scoring sentences , we retain one sentence as a reference sentence -- i.e. , its score is not decremented ) .
After calculating the raw score of each sentence , we use a modified version of the Adaptive Greedy Algorithm by @@CITATION to penalize redundant sentences in cohesive clusters .