Affordable Access

deepdyve-link
Publisher Website

Named entity disambiguation in short texts over knowledge graphs

Authors
  • Bouarroudj, Wissem
  • Boufaida, Zizette
  • Bellatreche, Ladjel
Type
Published Article
Journal
Knowledge and Information Systems
Publisher
Springer-Verlag
Publication Date
Jan 03, 2022
Volume
64
Issue
2
Pages
325–351
Identifiers
DOI: 10.1007/s10115-021-01642-9
PMID: 35001999
PMCID: PMC8722665
Source
PubMed Central
Keywords
Disciplines
  • Regular Paper
License
Unknown

Abstract

The ever-growing usage of knowledge graphs (KGs) positions named entity disambiguation (NED) at the heart of designing accurate KG-driven systems such as query answering systems (QAS). According to the current research, most studies dealing with NED on KGs involve long texts, which is not the case of short text fragments, identified by their limited contexts. The accuracy of QASs strongly depends on the management of such short text. This limitation motivates this paper, which studies the NED problem on KGs, involving only short texts. First, we propose a NED approach including the following steps: (i) context expansion using WordNet to measure its similarity to the resource context. (ii) Exploiting coherence between entities in queries that contain more than one entity, such as “Is Michelle Obama the wife of Barack Obama?”. (iii) Taking into account the relations between words to calculate their similarity with the properties of a resource. (iv) the use of syntactic features. The NED solution approach is compared to state-of-the-art approaches using five datasets. The experimental results show that our approach outperforms these systems by 27% in the F-measure. A system called Welink , implementing our proposal, is available on GitHub, and it is also accessible via a REST API.

Report this publication

Statistics

Seen <100 times