Computing lexical chains with graph clustering

Authors:
Olena Medelyan
Affiliations:
The University of Waikato, New Zealand
Venue:
ACL '07 Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop
Year:
2007

Citing 4
Cited 2

Efficiently computed lexical chains as an intermediate representation for automatic text summarization

Computational Linguistics - Summarization
Lexical cohesion computed by thesaural relations as an indicator of the structure of text

Computational Linguistics
BioChain: lexical chaining methods for biomedical text summarization

Proceedings of the 2006 ACM symposium on Applied computing
Chinese whispers: an efficient graph clustering algorithm and its application to natural language processing problems

TextGraphs-1 Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing

Query by document

Proceedings of the Second ACM International Conference on Web Search and Data Mining
Text summarisation in progress: a literature review

Artificial Intelligence Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text's cohesive structure. In contrast to previous methods, we are able to select chains based on their cohesive strength. This is achieved by analyzing the connectivity in graphs representing the lexical chains. We show that the generated chains significantly improve performance of automatic text summarization and keyphrase indexing.