A Term Weighting Method Based on Lexical Chain for Automatic Summarization (original) (raw)
Abstract
We suggest a new term weighting method based on lexical cohesion in a text. To compute cohesion, we use lexical chain with a new lexical chain disambiguation method considering association between words and characteristics of WordNet. In our experiment, the methods show a better result than traditional term weighting methods such as tf and tf.idf.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
- Morris, J., Hirst, G.: Lexical cohesion computed by thesaural relations as indicator of the structure of text. Computational linguistics 17(1), 21–45 (1991)
Google Scholar - Barzilay, R., Elhadad, M.: Lexical Chains for Text Summarization. Master’s thesis, Ben-Gurion University (1997)
Google Scholar - Siber, H.G., McCoy, K.F.: Efficient Text Summarization using Lexical Chains. In: Proceedings of the ACM Conference on Intelligent User Interfaces (2000)
Google Scholar
Author information
Authors and Affiliations
- Natural Language Processing Lab., Dept. of CSE, Korea University, Anam-dong 5-ga, Seongbuk-gu, 136-701, Seoul, Korea
Young-In Song, Kyoung-Soo Han & Hae-Chang Rim
Authors
- Young-In Song
- Kyoung-Soo Han
- Hae-Chang Rim
Editor information
Editors and Affiliations
- National Polytechnic Institute, Center for Computing Research, 07738, Mexico City, México
Alexander Gelbukh
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, YI., Han, KS., Rim, HC. (2004). A Term Weighting Method Based on Lexical Chain for Automatic Summarization. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2004. Lecture Notes in Computer Science, vol 2945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24630-5\_78
Download citation
- .RIS
- .ENW
- .BIB
- DOI: https://doi.org/10.1007/978-3-540-24630-5\_78
- Publisher Name: Springer, Berlin, Heidelberg
- Print ISBN: 978-3-540-21006-1
- Online ISBN: 978-3-540-24630-5
- eBook Packages: Springer Book Archive