Unsupervised learning of name structure from coreference data

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

Abstract

We present two methods for learning the structure of personal names from unlabeled data. The first simply uses a few implicit constraints governing this structure to gain a toehold on the problem - e.g., descriptors come before first names, which come before middle names, etc. The second model also uses possible coreference information. We found that coreference constraints on names improve the performance of the model from 92.6% to 97.0%. We are interested in this problem in its own right, but also possible way to improve named entity recognition (by recognizing the structure of different kinds of names) and as a way to improve noun-phrase coreference determination.

Cite

CITATION STYLE

APA

Charniak, E. (2001). Unsupervised learning of name structure from coreference data. In 2nd Meeting of the North American Chapter of the Association for Computational Linguistics, NAACL 2001. Association for Computational Linguistics (ACL). https://doi.org/10.3115/1073336.1073343

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