Abstract
Query-oriented update summarization is an emerging summarization task very recently. It brings new challenges to the sentence ranking algorithms that require not only to locate the important and query-relevant information, but also to capture the new information when document collections evolve. In this paper, we propose a novel graph based sentence ranking algorithm, namely PNR2, for update summarization. Inspired by the intuition that "a sentence receives a positive influence from the sentences that correlate to it in the same collection, whereas a sentence receives a negative influence from the sentences that correlates to it in the different (perhaps previously read) collection", PNR2 models both the positive and the negative mutual reinforcement in the ranking process. Automatic evaluation on the DUC 2007 data set pilot task demonstrates the effectiveness of the algorithm. Licensed under the Creative Commons.
Original language | English |
---|---|
Title of host publication | Coling 2008 - 22nd International Conference on Computational Linguistics, Proceedings of the Conference |
Pages | 489-496 |
Number of pages | 8 |
Volume | 1 |
Publication status | Published - 1 Dec 2008 |
Event | 22nd International Conference on Computational Linguistics, Coling 2008 - Manchester, United Kingdom Duration: 18 Aug 2008 → 22 Aug 2008 |
Conference
Conference | 22nd International Conference on Computational Linguistics, Coling 2008 |
---|---|
Country/Territory | United Kingdom |
City | Manchester |
Period | 18/08/08 → 22/08/08 |
ASJC Scopus subject areas
- Language and Linguistics
- Computational Theory and Mathematics
- Linguistics and Language