Analysis of syntax-based pronoun resolution methods

1999 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - 51 citations

Abstract

This paper presents a pronoun resolution algorithm that adheres to the constraints and rules of Centering Theory (Grosz et al., 1995) and is an alternative to Brennan et al.'s 1987 algorithm. The advantages of this new model, the Left-Right Centering Algorithm (LRC), lie in its incremental processing of utterances and in its low computational overhead. The algorithm is compared with three other pronoun resolution methods: Hobbs' syntax-based algorithm, Strube's S-list approach, and the BFP Centering algorithm. All four methods were implemented in a system and tested on an annotated subset of the Treebank corpus consisting of 2026 pronouns. The noteworthy results were that Hobbs and LRC performed the best.

Keywords

TreebankPronounComputer scienceSyntaxResolution (logic)Natural language processingArtificial intelligenceParsingAlgorithmLinguistics

Affiliated Institutions

Related Publications

Publication Info

Year
1999
Type
article
Pages
602-605
Citations
51
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

51
OpenAlex
4
Influential
18
CrossRef

Cite This

Joel Tetreault (1999). Analysis of syntax-based pronoun resolution methods. Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - , 602-605. https://doi.org/10.3115/1034678.1034688

Identifiers

DOI
10.3115/1034678.1034688

Data Quality

Data completeness: 86%