An algorithm to co-ordinate anaphora resolution and PPS disambiguation process

Authors:
Saliha Azzam
Affiliations:
CRIL Ingénierie - CAMS La Sorbonne, Puteaux, France
Venue:
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Year:
1995

Citing 3
Cited 3

Interpreting anaphors in natural language texts

Interpreting anaphors in natural language texts
Focusing for interpretation of pronouns

Computational Linguistics
Two principles of parse preference

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3

An Empirical Approach to Spanish Anaphora Resolution

Machine Translation
Anaphor resolution in unrestricted texts with partial parsing

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Anaphors, PPs and disambiguation process for conceptual analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Both anaphora resolution and prepositional phrase (PP) attachment are the most frequent ambiguities in natural language processing. Several methods have been proposed to deal with each phenomenon separately, however none of proposed systems has considered the way of dealing both phenomena We tackle this issue here, proposing an algorithm to co-ordinate the treatment of these two problems efficiently, i.e., the aim is also to exploit at each step all the results that each component can provide.