Using lexical chains for text summarization Academic Article uri icon

abstract

  • We investigate one technique to produce a summary of an original text without requiring its full semantic interpretation, but instead relying on a model of the topic progression in 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 partof -speech tagger and shallow parser for the identification of nominal groups, and a segmentation algorithm derived from [8]. 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. Preliminary results indicate that quality indicative summaries are produced and are extensively documented in http://www.cs.bgu.ac.il/ summarization-test. Pending problems are identified: the need for anaphora reso...

publication date

  • January 1, 1999