An algorithm for pronominal anaphora resolution
Computational Linguistics
Lexical cohesion computed by thesaural relations as an indicator of the structure of text
Computational Linguistics
| Hi-index | 0.00 |
This paper assumes that currently, anaphora resolution at a desired level of reliability has to remain partial. It presents the thesis that multiple small ("expert") procedures of known reliability that are conceived for partial analysis have to be developed and combined in order to increase coverage. These resolution experts will be specific to style, domain, task, etc. The paper describes corpus analysis that suggests such experts and their potential ordering. A quick and partial implementation of the ideas is evaluated on Wall Street Journal articles.