Automatic Knowledge Representation using a Graph-based Algorithm for LanguageIndependent Lexical Chaining (2006)
| Venue: | In Proceedings of the Workshop on Information Extraction Beyond the Document associated to the Joint Conference of the International Committee of Computational Linguistics and the Association for Computational Linguistics (COLING/ACL 2006 |
| Citations: | 3 - 3 self |
BibTeX
@INPROCEEDINGS{Dias06automaticknowledge,
author = {Gaël Dias},
title = {Automatic Knowledge Representation using a Graph-based Algorithm for LanguageIndependent Lexical Chaining},
booktitle = {In Proceedings of the Workshop on Information Extraction Beyond the Document associated to the Joint Conference of the International Committee of Computational Linguistics and the Association for Computational Linguistics (COLING/ACL 2006},
year = {2006},
pages = {36--47}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Lexical Chains are powerful representations of documents. In particular, they have successfully been used in the field of Automatic Text Summarization. However, until now, Lexical Chaining algorithms have only been proposed for English. In this paper, we propose a greedy Language-Independent algorithm that automatically extracts Lexical Chains from texts. For that purpose, we build a hierarchical lexico-semantic knowledge base from a collection of texts by using the Pole-Based Overlapping Clustering Algorithm. As a consequence, our methodology can be applied to any language and proposes a solution to languagedependent Lexical Chainers. 1
