Improving name tagging by reference resolution and relation detection

26Citations
Citations of this article
97Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Information extraction systems incorporate multiple stages of linguistic analysis. Although errors are typically compounded from stage to stage, it is possible to reduce the errors in one stage by harnessing the results of the other stages. We demonstrate this by using the results of coreference analysis and relation extraction to reduce the errors produced by a Chinese name tagger. We use an N-best approach to generate multiple hypotheses and have them re-ranked by subsequent stages of processing. We obtained thereby a reduction of 24% in spurious and incorrect name tags, and a reduction of 14% in missed tags. © 2005 Association for Computational Linguistics.

Cite

CITATION STYLE

APA

Ji, H., & Grishman, R. (2005). Improving name tagging by reference resolution and relation detection. In ACL-05 - 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (pp. 411–418). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1219840.1219891

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free