A graphical framework for contextual search and name disambiguation in email

Einat Minkov, William W. Cohen, Andrew Y. Ng

Research output: Contribution to conferencePaperpeer-review

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 baseline methods, and that further improvements can be obtained by use of appropriate learning methods.

Original languageEnglish
Pages1-8
Number of pages8
StatePublished - 2020
Externally publishedYes
Event1st Workshop on Graph-Based Algorithms for Natural Language Processing, Textgraphs 2006 at Human Language Technologies - New York City, United States
Duration: 9 Jun 2006 → …

Conference

Conference1st Workshop on Graph-Based Algorithms for Natural Language Processing, Textgraphs 2006 at Human Language Technologies
Country/TerritoryUnited States
CityNew York City
Period9/06/06 → …

Bibliographical note

Publisher Copyright:
© 2006 Association for Computational Linguistics

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'A graphical framework for contextual search and name disambiguation in email'. Together they form a unique fingerprint.

Cite this