KG-ZESHEL: Knowledge Graph-Enhanced Zero-Shot Entity Linking

2021 ◽  
Author(s):  
Petar Ristoski ◽  
Zhizhong Lin ◽  
Qunzhi Zhou
2018 ◽  
Vol 129 ◽  
pp. 110-114 ◽  
Author(s):  
Angen Luo ◽  
Sheng Gao ◽  
Yajing Xu

Author(s):  
Isaiah Onando Mulang’ ◽  
Kuldeep Singh ◽  
Akhilesh Vyas ◽  
Saeedeh Shekarpour ◽  
Maria-Esther Vidal ◽  
...  

2019 ◽  
Vol 1 (1) ◽  
pp. 77-98 ◽  
Author(s):  
Hailong Jin ◽  
Chengjiang Li ◽  
Jing Zhang ◽  
Lei Hou ◽  
Juanzi Li ◽  
...  

Knowledge bases (KBs) are often greatly incomplete, necessitating a demand for KB completion. Although XLORE is an English-Chinese bilingual knowledge graph, there are only 423,974 cross-lingual links between English instances and Chinese instances. We present XLORE2, an extension of the XLORE that is built automatically from Wikipedia, Baidu Baike and Hudong Baike. We add more facts by making cross-lingual knowledge linking, cross-lingual property matching and fine-grained type inference. We also design an entity linking system to demonstrate the effectiveness and broad coverage of XLORE2.


Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 453 ◽  
Author(s):  
Shengze Hu ◽  
Zhen Tan ◽  
Weixin Zeng ◽  
Bin Ge ◽  
Weidong Xiao

In the process of knowledge graph construction, entity linking is a pivotal step, which maps mentions in text to a knowledge base. Existing models only utilize individual information to represent their latent features and ignore the correlation between entities and their mentions. Besides, in the process of entity feature extraction, only partial latent features, i.e., context features, are leveraged to extract latent features, and the pivotal entity structural features are ignored. In this paper, we propose SA-ESF, which leverages the symmetrical Bi-LSTM neural network with the double attention mechanism to calculate the correlation between mentions and entities in two aspects: (1) entity embeddings and mention context features; (2) mention embeddings and entity description features; furthermore, the context features, structural features, and entity ID feature are integrated to represent entity embeddings jointly. Finally, we leverage (1) the similarity score between each mention and its candidate entities and (2) the prior probability to calculate the final ranking results. The experimental results on nine benchmark dataset validate the performance of SA-ESF where the average F1 score is up to 0.866.


Author(s):  
Kai Chen ◽  
Guohua Shen ◽  
Zhiqiu Huang ◽  
Haijuan Wang

Question Answering systems over Knowledge Graphs (KG) answer natural language questions using facts contained in a knowledge graph, and Simple Question Answering over Knowledge Graphs (KG-SimpleQA) means that the question can be answered by a single fact. Entity linking, which is a core component of KG-SimpleQA, detects the entities mentioned in questions, and links them to the actual entity in KG. However, traditional methods ignore some information of entities, especially entity types, which leads to the emergence of entity ambiguity problem. Besides, entity linking suffers from out-of-vocabulary (OOV) problem due to the limitation of pre-trained word embeddings. To address these problems, we encode questions in a novel way and encode the features contained in the entities in a multilevel way. To evaluate the enhancement of the whole KG-SimpleQA brought by our improved entity linking, we utilize a relatively simple approach for relation prediction. Besides, to reduce the impact of losing the feature during the encoding procedure, we utilize a ranking algorithm to re-rank (entity, relation) pairs. According to the experimental results, our method for entity linking achieves an accuracy of 81.8% that beats the state-of-the-art methods, and our improved entity linking brings a boost of 5.6% for the whole KG-SimpleQA.


Semantic Web ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 5-20
Author(s):  
Ahmad Alobaid ◽  
Emilia Kacprzak ◽  
Oscar Corcho

A lot of tabular data are being published on the Web. Semantic labeling of such data may help in their understanding and exploitation. However, many challenges need to be addressed to do this automatically. With numbers, it can be even harder due to the possible difference in measurement accuracy, rounding errors, and even the frequency of their appearance. Multiple approaches have been proposed in the literature to tackle the problem of semantic labeling of numeric values in existing tabular datasets. However, they also suffer from several shortcomings: closely coupled with entity-linking, rely on table context, need to profile the knowledge graph, and require manual training of the model. Above all, however, they all treat different types of numeric values evenly. In this paper, we tackle these problems and validate our hypothesis: whether taking into account the typology of numeric data in semantic labeling yields better results.


2021 ◽  
Author(s):  
Vincenzo Cutrona ◽  
Gianluca Puleri ◽  
Federico Bianchi ◽  
Matteo Palmonari

Matching tables against Knowledge Graphs is a crucial task in many applications. A widely adopted solution to improve the precision of matching algorithms is to refine the set of candidate entities by their type in the Knowledge Graph. However, it is not rare that a type is missing for a given entity. In this paper, we propose a methodology to improve the refinement phase of matching algorithms based on type prediction and soft constraints. We apply our methodology to state-of-the-art algorithms, showing a performance boost on different datasets.


Author(s):  
Isaiah Onando Mulang’ ◽  
Kuldeep Singh ◽  
Akhilesh Vyas ◽  
Saeedeh Shekarpour ◽  
Maria-Esther Vidal ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document