WordNet: a lexical database for English
Communications of the ACM
Computational Linguistics - Summarization
An Information-Theoretic Definition of Similarity
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Discovering word senses from text
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Lexical cohesion computed by thesaural relations as an indicator of the structure of text
Computational Linguistics
TnT: a statistical part-of-speech tagger
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
HLT '91 Proceedings of the workshop on Speech and Natural Language
Evaluating WordNet-based Measures of Lexical Semantic Relatedness
Computational Linguistics
Using information content to evaluate semantic similarity in a taxonomy
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Improving word sense disambiguation in lexical chaining
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations
EKAW '08 Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
Discovery of relation axioms from the web
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Hi-index | 0.00 |
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 language-dependent Lexical Chainers.