Affiliation:
1. National Centre for Text Mining, Department of Computer Science, University of Manchester, UK
2. Department of Computer Engineering, Ege University, Turkey
Abstract
General entity linking systems usually leverage global coherence of all the mapped entities in the same document by using semantic embeddings and graph-based approaches. However, graph-based approaches are computationally expensive for open-domain datasets. In this paper, the authors overcome these problems by presenting an RDF embedding-based seq2seq entity linking method in specific domains. They filter candidate entities of mentions having similar meanings by using the domain information of the annotated pairs. They resolve high ambiguous pairs by using Bi-directional long short-term memory (Bi-LSTM) and attention mechanism for the entity disambiguation. To evaluate the system with baseline methods, they generate a dataset including book, music, and movie categories. They achieved 0.55 (Mi-F1), 0.586 (Ma-F1), 0.846 (Mi-F1), and 0.87 (Ma-F1) scores for high and low ambiguous datasets. They compare the method by using recent (WNED-CWEB) datasets with existing methods. Considering the domain-specificity of the proposed method, it tends to achieve competitive results while using the domain-oriented datasets.
Subject
Computer Networks and Communications,Information Systems
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献