Combining Textual and Graph-Based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models

• Published in: Knowledge Engineering and Knowledge Management pp. 288 - 302
• Main Authors: Hakimov, Sherzod, Horst, Hendrik ter, Jebbara, Soufian, Hartung, Matthias, Cimiano, Philipp
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Collective entity disambiguation; Entity disambiguation; Factor graphs; Named entity disambiguation; Probabilistic graphical models
• ISBN: 9783319490038; 3319490036
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-49004-5_19

Named Entity Disambiguation (NED) is the task of disambiguating named entities in a natural language text by linking them to their corresponding entities in a knowledge base such as DBpedia, which are already recognized. It is an important step in transforming unstructured text into structured knowledge. Previous work on this task has proven a strong impact of graph-based methods such as PageRank on entity disambiguation. Other approaches rely on distributional similarity between an article and the textual description of a candidate entity. However, the combined impact of these different feature groups has not been explored to a sufficient extent. In this paper, we present a novel approach that exploits an undirected probabilistic model to combine different types of features for named entity disambiguation. Capitalizing on Markov Chain Monte Carlo sampling, our model is capable of exploiting complementary strengths between both graph-based and textual features. We analyze the impact of these features and their combination on named entity disambiguation. In an evaluation on the GERBIL benchmark, our model compares favourably to the current state-of-the-art in 8 out of 14 data sets.