Solving Hard Coreference Problems

By Haoruo Peng, Daniel Khashabi, Dan Roth. 2019

90 citations recorded by the source corpus.

Coreference resolution is a key problem in natural language understanding that still escapes reliable solutions. One fundamental difficulty has been that of resolving instances involving pronouns since they often require deep language understanding and use of background knowledge. In this paper we propose an algorithmic solution that involves a new representation for the knowledge required to address hard coreference problems, along with a constrained optimization framework that uses this knowledge in coreference decision making. Our representation, Predicate Schemas, is instantiated with knowledge acquired in an unsupervised way, and is compiled automatically into constraints that impact the coreference decision. We present a general coreference resolution system that significantly improves state-of-the-art performance on hard, Winograd-style, pronoun resolution cases, while still performing at the stateof-the-art level on standard coreference resolution 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. Yejin Choi
  2. Mohit Bansal
  3. Luke S. Zettlemoyer
  4. Hannaneh Hajishirzi
  5. Jianfeng Gao
  6. Percy Liang
  7. Noah A. Smith
  8. Caiming Xiong

In Natural Language Processing

  1. Yejin Choi
  2. Mohit Bansal
  3. Luke S. Zettlemoyer
  4. Hannaneh Hajishirzi
  5. Jianfeng Gao
  6. Noah A. Smith
  7. Graham Neubig
  8. Kyunghyun Cho

Citations in the corpus