| Título |
Terms Derived from Frequent Sequences for Extractive Text Summarization |
| Tipo |
Congreso |
| Sub-tipo |
SCOPUS |
| Descripción |
Lecture Notes in Computer Science |
| Resumen |
Automatic text summarization helps the user to quickly understand large volumes of information. We present a language- and domain-independent statistical-based method for single-document extractive summarization, i.e., to produce a text summary by extracting some sentences from the given text. We show experimentally that words that are parts of bigrams that repeat more than once in the text are good terms to describe the text’s contents, and so are also so-called maximal frequent sentences. We also show that the frequency of the term as term weight gives good results (while we only count the occurrences of a term in repeating bigrams). |
| Observaciones |
9th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2008; Code 73285; ISBN: 354078134X;978-354078134-9 |
| Lugar |
Haifa |
| País |
Israel |
| No. de páginas |
593-604 |
| Vol. / Cap. |
4914 |
| Inicio |
2008-02-17 |
| Fin |
2008-02-23 |
| ISBN/ISSN |
354078134X;978-35407 |
