Exploiting anonymous entity mentions for named entity linking

被引:0
作者
Feng Hou
Ruili Wang
See-Kiong Ng
Michael Witbrock
Fangyi Zhu
Xiaoyun Jia
机构
[1] Massey University,School of Mathematical and Computational Sciences
[2] National University of Singapore,Institute of Data Science
[3] University of Auckland,School of Computer Science
[4] Shandong University,Institute of Governance and School of Politics and Public Administration
来源
Knowledge and Information Systems | 2023年 / 65卷
关键词
Entity linking; Fine-grained entity types; Anonymous entity type words; Entity embeddings;
D O I
暂无
中图分类号
学科分类号
摘要
Named entity linking or named entity disambiguation is to link entity mentions to corresponding entities in a knowledge base for resolving the ambiguity of entity mentions. Recently, collective linking methods exploit document-level coherence of the referenced entities by computing a pairwise score between candidates of a pair of named entity mentions (e.g., Raytheon and Boeing) in a document. However, in a document, named entity mentions are significantly less frequent than anonymous entity mentions (e.g., defense contractor and the company). In this paper, we propose a method, DOCument-level Anonymous Entity Type words relatedness (DOC-AET), to exploit the document-level coherence between candidate entities and anonymous entity mentions. We use the anonymous entity type (AET) words to extract anonymous entity mentions. We learn embeddings of AET words from their inter-paragraph co-occurrence matrix; thus, the document-level entity-type relatedness is encoded in the AET word embeddings. Then, we compute the coherence scores between candidate entities and anonymous entity mentions using the AET entity embeddings and document context embeddings. By incorporating such coherence scores for candidates ranking, DOC-AET has achieved new state-of-the-art results on two of the five out-domain test sets for named entity linking.
引用
收藏
页码:1221 / 1242
页数:21
相关论文
共 43 条
[1]  
Arora S(2018)Linear algebraic structure of word senses, with applications to polysemy Trans Assoc Comput Linguist 6 483-495
[2]  
Li Y(2015)Entity disambiguation with web links Trans Assoc Comput Linguist 3 145-156
[3]  
Liang Y(2021)Simple question answering over knowledge graph enhanced by question pattern classification Knowl Inf Syst 63 2741-2761
[4]  
Ma T(2019)Ad hoc retrieval via entity linking and semantic similarity Knowl Inf Syst 58 551-583
[5]  
Risteski A(2018)Robust named entity disambiguation with random walks Sem Web (Preprint) 9 459-479
[6]  
Chisholm A(2021)Transfer learning for fine-grained entity typing Knowl Inf Syst 63 845-866
[7]  
Hachey B(2019)Collective entity resolution in multi-relational familial networks Knowl Inf Syst 61 1547-1581
[8]  
Cui H(2019)Collective entity linking: a random walk-based perspective Knowl Inf Syst 60 1611-1643
[9]  
Peng T(2019)Pair-linking for collective entity disambiguation: two could be better than all IEEE Trans Knowl Data Eng 31 1383-1396
[10]  
Feng L(2015)Entity linking with a knowledge base: issues, techniques, and solutions IEEE Trans Knowl Data Eng 27 443-460