2012 · 210 citations · 36 references
ComputingComputer ScienceComputational LinguisticsInformation RetrievalNatural Language ProcessingNamed Entity RecognitionSemantic NetworksEntity DisambiguationEntity LinkingEntity Mention DisambiguationHashingKnowledge Base LinkingLocality-sensitive HashingSemantic LinkingSemantic Relatedness
Measuring the semantic relatedness between two entities is the basis for numerous tasks in IR, NLP, and Web-based knowledge extraction. This paper focuses on disambiguating names in a Web or text document by jointly mapping all names onto semantically related entities registered in a knowledge base. To this end, we have developed a novel notion of semantic relatedness between two entities represented as sets of weighted (multi-word) keyphrases, with consideration of partially overlapping phrases. This measure improves the quality of prior link-based models, and also eliminates the need for (usually Wikipedia-centric) explicit interlinkage between entities. Thus, our method is more versatile and can cope with long-tail and newly emerging entities that have few or no links associated with them. For efficiency, we have developed approximation techniques based on min-hash sketches and locality-sensitive hashing. Our experiments on semantic relatedness and on named entity disambiguation demonstrate the superiority of our method compared to state-of-the-art baselines.
36
Piotr Indyk, Rajeev Motwani · 1998 · 4.2K citations · Full text
Fabian M. Suchanek, Gjergji Kasneci, Gerhard Weikum · 2007 · 3.9K citations · Full text
Similarity Search in High Dimensions via Hashing
Aristides Gionis, Piotr Indyk, Rajeev Motwani · 1999 · 3.1K citations