Entity Disambiguation Based on Parse Tree Neighbours on Graph Attention Network

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Entity disambiguation (ED) aims to link textual mentions in a document to the correct named entities in a knowledge base (KB). Although global ED model usually outperforms local model by collectively linking mentions based on the topical coherence assumption, it may still incur incorrect entity assignment when a document contains multiple topics. Therefore, we propose to extract global features locally, i.e., among a limited number of neighbouring mentions, to combine the respective superiority of both models. In particular, we derive mention neighbours according to the syntactic distance on a dependency parse tree, and propose a tree connection method CoSimTC to measure the cross-tree distance between mentions. Besides, we extend the Graph Attention Network (GAT) to integrate both local and global features to produce a discriminative representation for each candidate entity. Our experimental results on five widely-adopted public datasets demonstrate better performance compared with state-of-the-art approaches.

Cite

CITATION STYLE

APA

Xin, K., Hua, W., Liu, Y., & Zhou, X. (2019). Entity Disambiguation Based on Parse Tree Neighbours on Graph Attention Network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11881 LNCS, pp. 523–537). Springer. https://doi.org/10.1007/978-3-030-34223-4_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free