A graphical framework for contextual search and name disambiguation in email

  • Authors:
  • Einat Minkov;William W. Cohen;Andrew Y. Ng

  • Affiliations:
  • Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Stanford University, Stanford, CA

  • Venue:
  • TextGraphs-1 Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

Similarity measures for text have historically been an important tool for solving information retrieval problems. In this paper we consider extended similarity metrics for documents and other objects embedded in graphs, facilitated via a lazy graph walk. We provide a detailed instantiation of this framework for email data, where content, social networks and a timeline are integrated in a structural graph. The suggested framework is evaluated for the task of disambiguating names in email documents. We show that reranking schemes based on the graph-walk similarity measures often outperform base-line methods, and that further improvements can be obtained by use of appropriate learning methods.