Olena Medelyan
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.
- Chris Biemann 2006. Chinese Whispers---an Efficient Graph Clustering Algorithm and its Application to Natural Language Processing Problems. In Proc of the HLT-NAACL-06 Workshop on Textgraphs, pp. 73--80. Google Scholar
Digital Library
- Regina Barzilay and Michael Elhadad. 1997. Using Lexical Chains for Text Summarization, In Proc of the ACL Intelligent Scalable Text Summarization Workshop, pp. 10--17.Google Scholar
- Stijn M. van Dongen. 2000. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht.Google Scholar
- William P. Doran, Nicola Stokes, Joe Carthy and John Dunnion. 2004. Assessing the Impact of Lexical Chain Scoring Methods on Summarization. In Proc of CICLING'04, pp. 627--635.Google Scholar
- Laura Hasler, Constantin Orasan and Ruslan Mitkov. 2003. Building Better Corpora for Summarization. In Proc of Corpus Linguistics CL'03, pp. 309--319.Google Scholar
- George Hripcsak and Adam S. Rothschild. 2005. Agreement, the F-Measure, and Reliability in IR. JAMIA, (12), pp. 296--298.Google Scholar
- Jane Morris and Graeme Hirst. 1991. Lexical Cohesion Computed by Thesaural Relations as an Indicator of the Structure of Text. Computational Linguistics, 17(1), pp. 21--48. Google ScholarDigital Library
- Lawrence H. Reeve, Hyoil Han and Ari D. Brooks. 2006. BioChain: Using Lexical Chaining for Biomedical Text Summarization. In Proc of the ACM Symposium on Applied Computing, pp. 180--184. Google ScholarDigital Library
- Gregory Silber and Kathleen McCoy, 2002. Efficiently Computed Lexical Chains as an Intermediate Representation for Automatic Text Summarization. Computational Linguistics, vol. 28, pp. 487--496. Google ScholarDigital Library
- Computing lexical chains with graph clustering
Recommendations
Unsupervised word sense disambiguation with lexical chains and graph-based context formalization
LTC'09: Proceedings of the 4th conference on Human language technology: challenges for computer science and linguisticsThis paper presents an unsupervised word sense disambiguation. (WSD) algorithm that makes use of lexical chains concept [6] to quantify the degree of semantic relatedness between two words. Essentially, the WSD algorithm will try to maximize this ...
Automatic text summarization based on lexical chains
ICNC'05: Proceedings of the First international conference on Advances in Natural Computation - Volume Part IThe method of lexical chains is the first time introduced to generate summaries from Chinese texts. The algorithm which computes lexical chains based on the HowNet knowledge database is modified to improve the performance and suit Chinese summarization. ...
Comments