Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity

By R. Sinha, Rada Mihalcea. International Computer Science Conference, 2007

303 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

KORE: keyphrase overlap relatedness for entity disambiguation (2012, background): “has been shown in a wide variety of tasks: named entity disambiguation [23, 19, 16], general word sense disambiguation [31, 24, 26], query expansion for information retrieval [18, 25], Web-based information extraction [1], knowledge base population [9, 30], and more.”
Incorporating Coreference Resolution into Word Sense Disambiguation (2011, background): “Some WSD systems are built on lexical knowledge base [4-9].”
Entity Linking meets Word Sense Disambiguation: a Unified Approach (2014, unknown): “Other approaches, instead, leverage the structural properties of the knowledge base by exploiting centrality and connectivity measures (Sinha and Mihalcea, 2007; Tsatsaronis et al., 2007; Agirre and Soroa, 2009; Navigli and Lapata, 2010).”
Personalizing PageRank for Word Sense Disambiguation (2009, methodology): “Recently, graph-based methods for knowledgebased WSD have gained much attention in the NLP community (Sinha and Mihalcea, 2007; Navigli and Lapata, 2007; Mihalcea, 2005; Agirre and Soroa, 2008).”