For an Incremental Computation of Intrasentential Coreference
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Natural Language. 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.
@inproceedings{ijcai1993p168,
title = {For an Incremental Computation of Intrasentential Coreference},
author = {Merlo, Paola},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {1216--1220},
year = {1993},
note = {Natural Language},
url = {https://ijcai.org/proceedings/1993/168},
}
TY - CPAPER TI - For an Incremental Computation of Intrasentential Coreference AU - Merlo, Paola T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 1216 EP - 1220 UR - https://ijcai.org/proceedings/1993/168 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
