about
Dual-FOFE-Net Neural Models for Entity Linking with PageRank (arxiv.org)
2 points by sel1 on Aug 1, 2019 | hide | past | pdf | discuss on HN

In plain words: To link names in text to the things they mean, this system turns a name and nearby words into one fixed-size summary and ranks candidates with a simple feedforward network. It beat the best prior systems on one test set without extra data or hand-built features, and matched them on another.

Abstract · Dual-FOFE-net Neural Models for Entity Linking with PageRank

This paper presents a simple and computationally efficient approach for entity linking (EL), compared with recurrent neural networks (RNNs) or convolutional neural networks (CNNs), by making use of feedforward neural networks (FFNNs) and the recent dual fixed-size ordinally forgetting encoding (dual-FOFE) method to fully encode the sentence fragment and its left/right contexts into a fixed-size representation. Furthermore, in this work, we propose to incorporate PageRank based distillation in our candidate generation module. Our neural linking models consist of three parts: a PageRank based candidate generation module, a dual-FOFE-net neural ranking model and a simple NIL entity clustering system. Experimental results have shown that our proposed neural linking models achieved higher EL accuracy than state-of-the-art models on the TAC2016 task dataset over the baseline system, without requiring any in-house data or complicated handcrafted features. Moreover, it achieves a competitive accuracy on the TAC2017 task dataset.

Feng Wei, Uyen Trang Nguyen, Hui Jiang
arXiv:1907.12697 · cs.CL, cs.IR, cs.LG · submitted Jul 30, 2019
abstract · pdf · html · ICANN 2019

add comment on HN