A Scalable Gibbs Sampler for Probabilistic Entity Linking

  • Neil Houlsby
  • Massimiliano Ciaramita
Conference paper

DOI: 10.1007/978-3-319-06028-6_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8416)
Cite this paper as:
Houlsby N., Ciaramita M. (2014) A Scalable Gibbs Sampler for Probabilistic Entity Linking. In: de Rijke M. et al. (eds) Advances in Information Retrieval. ECIR 2014. Lecture Notes in Computer Science, vol 8416. Springer, Cham

Abstract

Entity linking involves labeling phrases in text with their referent entities, such as Wikipedia or Freebase entries. This task is challenging due to the large number of possible entities, in the millions, and heavy-tailed mention ambiguity. We formulate the problem in terms of probabilistic inference within a topic model, where each topic is associated with a Wikipedia article. To deal with the large number of topics we propose a novel efficient Gibbs sampling scheme which can also incorporate side information, such as the Wikipedia graph. This conceptually simple probabilistic approach achieves state-of-the-art performance in entity-linking on the Aida-CoNLL dataset.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Neil Houlsby
    • 1
  • Massimiliano Ciaramita
    • 2
  1. 1.University of CambridgeUK
  2. 2.Google ResearchZürichSwitzerland

Personalised recommendations