Context Sensitive Paraphrasing with a Global Unsupervised Classifier

  • Authors:
  • Michael Connor;Dan Roth

  • Affiliations:
  • Department of Computer Science, University of Illinois at Urbana-Champaign,;Department of Computer Science, University of Illinois at Urbana-Champaign,

  • Venue:
  • ECML '07 Proceedings of the 18th European conference on Machine Learning
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Lexical paraphrasing is an inherently context sensitive problem because a word's meaning depends on context. Most paraphrasing work finds patterns and templates that can replace other patterns or templates in somecontext, but we are attempting to make decisions for a specificcontext. In this paper we develop a global classifier that takes a word vand its context, along with a candidate word u, and determines whether ucan replace vin the given context while maintaining the original meaning.We develop an unsupervised, bootstrapped, learning approach to this problem. Key to our approach is the use of a very large amount of unlabeled data to derive a reliable supervision signal that is then used to train a supervised learning algorithm. We demonstrate that our approach performs significantly better than state-of-the-art paraphrasing approaches, and generalizes well to unseen pairs of words.