Bootstrapping Path-Based Pronoun Resolution

By Shane Bergsma, Dekang Lin. 2006

153 citations recorded by the source corpus.

We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a candidate noun based on the path in the parse tree between the two entities. This path information enables us to handle previously challenging resolution instances, and also robustly addresses traditional syntactic coreference constraints. Highly coreferent paths also allow mining of precise probabilistic gender/number information. We combine statistical knowledge with well known features in a Support Vector Machine pronoun resolution classifier. Significant gains in performance are observed on several datasets.

Subfields: Artificial Intelligence, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Yejin Choi
  3. Christopher D. Manning
  4. Noah A. Smith
  5. Yonatan Belinkov
  6. Luke S. Zettlemoyer
  7. Jianfeng Gao
  8. Percy Liang

In Natural Language Processing

  1. Christopher D. Manning
  2. Mohit Bansal
  3. Yonatan Belinkov
  4. Yejin Choi
  5. Luke S. Zettlemoyer
  6. Noah A. Smith
  7. Greg Durrett
  8. Percy Liang

Citations in the corpus