Improved Unsupervised Name Discrimination with Very Wide Bigrams and Automatic Cluster Stopping

We cast name discrimination as a problem in clustering short contexts. Each occurrence of an ambiguous name is treated independently, and represented using second?order context vectors. We calibrate our approach using a manually annotated collection of five ambiguous names from the Web, and then apply the learned parameter settings to three held-out sets of pseudo-name data that have been reported on in previous publications. We find that significant improvements in the accuracy of name discrimination can be achieved by using very wide bigrams, which are ordered pairs of words with up to 48 intervening words between them. We also show that recent developments in automatic cluster stopping can be used to predict the number of underlying identities without any significant loss of accuracy as compared to previous approaches which have set these values manually.

• Type: Conference
• Year: 2009
• Where: CICLING
• Authors: Ted Pedersen
• Keywords: Ambiguous Names, CICLING 2009, Natural Language Processing, Significant Improvements