---
title: "For an Incremental Computation of Intrasentential Coreference"
authors:
  - "Paola Merlo"
doi: ""
url: "https://ijcai.org/proceedings/1993/168"
pdf: "https://ijcai.org/proceedings/1993/0168.pdf"
venue: "Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence"
year: 1993
pages: "1216-1220"
track: "Natural Language"
keywords:
---

# For an Incremental Computation of Intrasentential Coreference

Paola Merlo

*Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence*, pages 1216-1220.

## Abstract

In this paper, we present a set of algorithm s to compute coreference, according to Binding theory, as presented in [Chomsky, 1986]. The novelty of the computational solution is two-fold: it is incremental and it computes both possible and impossible antecedents dynamically. Incr ementality is crucial for the efficiency of a system, because the search space of possible analyses for a correct input sentence can be pruned earlier, and possible sources of ungrammaticality for incorrect input are discovered early in the parse. The local domain of coreference is computed dynamically , thus handling cases which previous proposals could not solve correctly.