A candidate generation algorithm for named entities disambiguation using DBpedia

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Word Sense Disambiguation (WSD) is the process of choosing one sense to an ambiguous word in a context. Ambiguity refers to the fact that a word can have different meanings. One form of the lexical ambiguity is polysemy (Apple is the company and eventually the fruit). The state-of-art approaches generally extract named entities (NE), generate candidate entities from a Knowledge Base (KB), and apply a comparison method to select the correct one. As a complement to the majority of those approaches which do not use the NE categories, we propose a disambiguation algorithm that uses those categories to reduce the number of the candidates. For instance, categories include person, location, organization, etc. we will show that considering them will considerably reduce the number of the resulting candidates. In this paper, we will focus on the step of generating the candidate entities from a KB, thus we will propose an algorithm that will use DBpedia to link NE categories to the values of rdf:type property. The obtained results are very promising.

Cite

CITATION STYLE

APA

Bouarroudj, W., & Boufaida, Z. (2018). A candidate generation algorithm for named entities disambiguation using DBpedia. In Advances in Intelligent Systems and Computing (Vol. 745, pp. 712–721). Springer Verlag. https://doi.org/10.1007/978-3-319-77703-0_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free