{"type":"ScholarlyArticle","title":"For an Incremental Computation of Intrasentential Coreference","authors":[{"name":"Paola Merlo","slug":"paola-merlo","given":"Paola","family":"Merlo","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1993/168","pdf":"https://ijcai.org/proceedings/1993/0168.pdf","markdown":"https://ijcai.org/proceedings/1993/168.md","bibtex":"https://ijcai.org/proceedings/1993/bibtex/168","volume":{"slug":"1993","title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1993","url":"https://ijcai.org/proceedings/1993/","year":1993,"location":"Chambéry, France","dates":"","editors":"Ruzena Bajcsy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Natural Language","track":"Natural Language","number":168,"pages":{"first":1216,"last":1220},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}