Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Sparse Lexical Representation for Semantic Entity Resolution

Yuzhe Jin, Kuansan Wang, and Emre Kıcıman

Abstract

This paper addresses the problem of semantic entity resolution (SER), which aims to determine whether some or none of the entities in a knowledge base is mentioned in a given web document. The lexical features, e.g., words and phrases, which are critical to the resolution of the semantic entities are typically of a small amount compared to all lexical features in the web document, and therefore can be modeled as sparse signals. Two techniques leveraging the principles of sparse signal recovery are proposed to identify the sparse, salient lexical features: one technique, based on the Lasso algorithm with the ℓ2-norm distance metric, attempts to recover all the salient lexical features at once; the other technique, namely Posterior Probability Pursuit (PPP), sequentially identifies salient features one after one using the negative log posterior probability as the distance metric. Using a knowledge base consisting of about 100 million entities, we show that the proposed techniques exploiting the sparsity nature underlying SER deliver substantial performance improvement over baseline methods without sparsity consideration, demonstrating the potentials of sparse signal techniques in entity-centric web information processing.

Details

Publication typeProceedings
Published inICASSP 2013
PublisherIEEE
> Publications > Sparse Lexical Representation for Semantic Entity Resolution