Abstract
We investigate one technique to produce a summary of an original text without requiring full semantic interpretation, but instead relying on a model of
the topic progression of the text derived from lexical chains. We present a new algorithm to compute lexical chains in a text, merging several robust
knowledge sources: the WordNet thesaurus, a part-of-speech tagger and shallow parser for the identification of nominal groups, and a segmentation algorithm derived from (Hearst, 1994). Summarization proceeds in three steps: the original text is first segmented, lexical chains are constructed, strong chains are identified and significant sentences are extracted from the text. We present in this paper empirical results on the identification of strong chains and of significant sentences.
the topic progression of the text derived from lexical chains. We present a new algorithm to compute lexical chains in a text, merging several robust
knowledge sources: the WordNet thesaurus, a part-of-speech tagger and shallow parser for the identification of nominal groups, and a segmentation algorithm derived from (Hearst, 1994). Summarization proceeds in three steps: the original text is first segmented, lexical chains are constructed, strong chains are identified and significant sentences are extracted from the text. We present in this paper empirical results on the identification of strong chains and of significant sentences.
| Original language | English |
|---|---|
| Title of host publication | Intelligent Scalable Text Summarization |
| Subtitle of host publication | Workshop held at ACL 1997 |
| Place of Publication | Madrid |
| Publisher | Association for Computational Linguistics (ACL) |
| Pages | 10-17 |
| Number of pages | 8 |
| State | Published - 1997 |
Fingerprint
Dive into the research topics of 'Using Lexical Chains for Text Summarization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver