Neto, J.L. and Santos, A.D. and Kaestner, Celso A.A. and Freitas, A.A. and Nievola, J.C. (2000) A Trainable Algorithm for Summarizing News Stories. In: Proc. PKDD'2000 Workshop on Machine Learning and Textual Information Access.
|
Download (116Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (482Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
Abstract
This work proposes a trainable system for summarizing news and obtaining an approximate argumentative structure of the source text. To achieve these goals we use several techniques and heuristics, such as detecting the main concepts in the text, connectivity between sentences, occurrence of proper nouns, anaphors, discourse markers and a binary-tree representation (due to the use of an agglomerative clustering algorithm). The proposed system was evaluated on a set of 800 documents.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 12 Sep 2009 16:23 |
| Last Modified: | 08 Jun 2012 13:51 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21963 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
