Using graph distances for named-entity linking ?
We formalize entity linking as an optimization problem. The problem is NP-hard but solvable in linear time under restrictive assumptions. We propose heuristics enforcing the assumptions or optimizing similar objectives. We show how our approaches perform w.r.t. some baselines on real data.
entity linking maximum capacity representative set minimum distance representative