By the same authors

Word sense induction disambiguation using hierarchical random graphs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Department/unit(s)

Publication details

Title of host publicationEMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
DatePublished - 2010
Pages745-755
Number of pages10
PublisherAssociation for Computational Linguistics
Place of PublicationStroudsburg, PA
Original languageEnglish

Abstract

Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and others. Most of the work in these areas formulate their problem in a graph-based setting and apply unsupervised graph clustering to obtain a set of clusters. Recent studies suggest that graphs often exhibit a hierarchical structure that goes beyond simple flat clustering. This paper presents an unsupervised method for inferring the hierarchical grouping of the senses of a polysemous word. The inferred hierarchical structures are applied to the problem of word sense disambiguation, where we show that our method performs significantly better than traditional graph-based methods and agglomerative clustering yielding improvements over state-of-the-art WSD systems based on sense induction.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations