Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing 2015
DOI: 10.18653/v1/d15-1081
|View full text |Cite
|
Sign up to set email alerts
|

Language and Domain Independent Entity Linking with Quantified Collective Validation

Abstract: Linking named mentions detected in a source document to an existing knowledge base provides disambiguated entity referents for the mentions.This allows better document analysis, knowledge extraction and knowledge base population. Most of the previous research extensively exploited the linguistic features of the source documents in a supervised or semi-supervised way. These systems therefore cannot be easily applied to a new language or domain. In this paper, we present a novel unsupervised algorithm named Quan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 34 publications
(28 citation statements)
references
References 15 publications
(18 reference statements)
0
28
0
Order By: Relevance
“…Without frequency statistics and meta-data, the task becomes substantially more challenging. Some prior works have pointed out the importance of building entity linking systems that can generalize to unseen entity sets (Sil et al, 2012;Wang et al, 2015), but adopt an additional set of assumptions.…”
Section: Testmentioning
confidence: 99%
“…Without frequency statistics and meta-data, the task becomes substantially more challenging. Some prior works have pointed out the importance of building entity linking systems that can generalize to unseen entity sets (Sil et al, 2012;Wang et al, 2015), but adopt an additional set of assumptions.…”
Section: Testmentioning
confidence: 99%
“…They also do not attempt to learn a disambiguation model but directly train their system to replicate noisy projected annotations. Wang et al (2015) refer to their approach as unsupervised, as they do not use unlabeled data. However, their method does not involve any learning and relies on matching heuristics.…”
Section: Related Workmentioning
confidence: 99%
“…The approach developed in this paper makes significantly simpler assumptions on the availability of such resources, and therefore can scale also to lowerresource languages, while doing very well also on high-resource languages. Wang et al (2015) proposed an unsupervised method which matches a knowledge graph with a graph constructed from mentions and the corre-sponding candidates of the query document. This approach performs well on the Chinese dataset of TAC'13, but falls into the category (1).…”
Section: Related Workmentioning
confidence: 99%