2014
DOI: 10.1162/tacl_a_00179
|View full text |Cite
|
Sign up to set email alerts
|

Entity Linking meets Word Sense Disambiguation: a Unified Approach

Abstract: Entity Linking (EL) and Word Sense Disambiguation (WSD) both address the lexical ambiguity of language. But while the two tasks are pretty similar, they differ in a fundamental respect: in EL the textual mention can be linked to a named entity which may or may not contain the exact mention, while in WSD there is a perfect match between the word form (better, its lemma) and a suitable word sense. In this paper we present Babelfy, a unified graph-based approach to EL and WSD based on a loose identification of c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
459
0
4

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 593 publications
(466 citation statements)
references
References 37 publications
1
459
0
4
Order By: Relevance
“…Knowledge is often stored in form of ontologies or similar graph-based structures. This typically leads to a local context that is also defined within graphs (Fenza et al, 2009;Moro et al, 2014).…”
Section: Related Workmentioning
confidence: 99%
“…Knowledge is often stored in form of ontologies or similar graph-based structures. This typically leads to a local context that is also defined within graphs (Fenza et al, 2009;Moro et al, 2014).…”
Section: Related Workmentioning
confidence: 99%
“…PageRank represents the web as a graph and estimates the importance of a web page on the basis of the structural properties of the graph. The algorithm has been successfully used in various fields including NLP where it has found numerous applications: sentiment polarity detection [121], Word Sense Disambiguation [122][123][124][125], semantic similarity [93,94,89], keyword extraction [126], and lexical resource alignment [127,20].…”
Section: Pagerankmentioning
confidence: 99%
“…-Babelfy Babelfy (Moro et al 2014) is a graph-based word sense disambiguation (WSD) algorithm based on a loose identification of candidate meanings coupled with a densest sub-graph heuristic which selects highcoherence semantic interpretations. Babelfy disambiguates all nominal and named entity mentions occurring within a text, using the BabelNet semantic network (Navigli et al 2012), a very large multilingual knowledge base obtained from the automatic integration of Wikipedia and WordNet.…”
Section: Resourcesmentioning
confidence: 99%
“…However, as will be shown later in this paper, 82 % of users have at least one topical friend among their friends, and the average number is 12.7. Since, in general, multiple pages may correspond to a user name, we perform joint name resolution and disambiguation using a state-of-the-art online word sense disambiguation algorithm, Babelfy (Moro et al 2014), which disambiguates a textual input against WiBi categories. We use Babelfy as follows: for any user and screen-name, e.g., @britneyspears, we first retrieve from the corresponding Twitter profile the field's name, line À status, and location, e.g., ''Britney Spears'', ''It's Britney...'', ''Los Angeles, CA''.…”
Section: User Representationmentioning
confidence: 99%
See 1 more Smart Citation