Anaphora resolution with real preprocessing

Authors:
Manfred Klenner;Don Tuggener;Angela Fahrni;Rico Sennrich
Affiliations:
Institute of Computational Linguistics, Zurich;Institute of Computational Linguistics, Zurich;Institute of Computational Linguistics, Zurich;Institute of Computational Linguistics, Zurich
Venue:
IceTAL'10 Proceedings of the 7th international conference on Advances in natural language processing
Year:
2010

Citing 4
Cited 0

A machine learning approach to coreference resolution of noun phrases

Computational Linguistics - Special issue on computational anaphora resolution
Optimizing algorithms for pronoun resolution

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
On coreference resolution performance metrics

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Optimization in coreference resolution is not needed: a nearly-optimal algorithm with intensional constraints

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we focus on anaphora resolution for German, a highly inflected language which also allows for closed form compounds (i.e. compounds without spaces). Especially, we describe a system that only uses real preprocessing components, e.g. a dependency parser, a two-level morphological analyser etc. We trace the performance drop occurring under these conditions back to underspecification and ambiguity at the morphological level. A demanding subtask of anaphora resolution are the so-called bridging anaphora, a special variant of nominal anaphora where the heads of the coreferent noun phrases do not match. We experiment with two different resources in order to find out how to cope best with this problem.