2015
DOI: 10.1007/978-3-319-24309-2_28
|View full text |Cite
|
Sign up to set email alerts
|

A Logic-Based Approach to Named-Entity Disambiguation in the Web of Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…KORE uses keyphrase overlap relatedness to relate entities in the text to pre-extracted entities from Wikipedia (Hoffart et al, 2012). Other approaches use a notion of exclusivity-base relatedness to measure how similar two nodes are in a graph (Giannini et al, 2015), and a common subsumers algorithm between ambiguous entities and close entities that are unambiguous (Hulpus et al, 2015) for disambiguation.…”
Section: Named Entity Disambiguationmentioning
confidence: 99%
“…KORE uses keyphrase overlap relatedness to relate entities in the text to pre-extracted entities from Wikipedia (Hoffart et al, 2012). Other approaches use a notion of exclusivity-base relatedness to measure how similar two nodes are in a graph (Giannini et al, 2015), and a common subsumers algorithm between ambiguous entities and close entities that are unambiguous (Hulpus et al, 2015) for disambiguation.…”
Section: Named Entity Disambiguationmentioning
confidence: 99%
“…KORE [130] uses keyphrase overlap relatedness to relate entities in the text to pre-extracted entities from Wikipedia. Other approaches use a notion of exclusivity-base relatedness to measure how similar two nodes in a graph are [111], and a common subsumers algorithm between ambiguous entities and close entities that are unambiguous [133] for disambiguation.…”
Section: Linking Resources To Entitiesmentioning
confidence: 99%