| Título |
Formal Grammar for Hispanic Named Entities Analysis |
| Tipo |
Congreso |
| Sub-tipo |
SCOPUS |
| Descripción |
Lecture Notes in Computer Science |
| Resumen |
A task that has been widely studied in the field of natural language processing is the Named Entity Recognition (NER). A great number of approaches have been developed to deal with the identification and classification of named entity strings in specific- and open-domains. Nevertheless, external modules have to be incorporated into many of the NER systems in order to solve the interpretation problems derived from proper nouns. In this article our focus will be on the study of ambiguity in Hispanic Nominal Sequences which constitution assumes three main problems: (1) the association of given names and/or surnames; (2) the composition of such elements by means of a connector; (3) and the duality of given name/surname. In order to analyze the magnitude of the problem, two gazetteers were made, one with 93998 given names and the other with 13779 surnames. The gazetteers entries were used as terminal symbols of the proposed grammar to determine the valid interpretations in the nominal sequences; this is done by means of an automatic labeling of all the elements the nominal sequences are made of. |
| Observaciones |
10th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2009; Code 76623 |
| Lugar |
Ciudad de México |
| País |
Mexico |
| No. de páginas |
183-194 |
| Vol. / Cap. |
5449 |
| Inicio |
2009-03-01 |
| Fin |
2009-03-07 |
| ISBN/ISSN |
3642003818;978-36420 |
