Affiliation:
1. University of Calcutta, Kolkata, India
2. Dublin City University, Dublin, Ireland
3. Indian Statistical Institute, Kolkata, India
Abstract
In this article, we propose a word embedding--based named entity recognition (NER) approach. NER is commonly approached as a sequence labeling task with the application of methods such as conditional random field (CRF). However, for low-resource languages without the presence of sufficiently large training data, methods such as CRF do not perform well. In our work, we make use of the proximity of the vector embeddings of words to approach the NER problem. The hypothesis is that word vectors belonging to the same name category, such as a person’s name, occur in close vicinity in the abstract vector space of the embedded words. Assuming that this clustering hypothesis is true, we apply a standard classification approach on the vectors of words to learn a decision boundary between the NER classes. Our NER experiments are conducted on a morphologically rich and low-resource language, namely Bengali. Our approach significantly outperforms standard baseline CRF approaches that use cluster labels of word embeddings and gazetteers constructed from Wikipedia. Further, we propose an unsupervised approach (that uses an automatically created named entity (NE) gazetteer from Wikipedia in the absence of training data). For a low-resource language, the word vectors obtained from Wikipedia are not sufficient to train a classifier. As a result, we propose to make use of the distance measure between the vector embeddings of words to expand the set of Wikipedia training examples with additional NEs extracted from a monolingual corpus that yield significant improvement in the unsupervised NER performance. In fact, our expansion method performs better than the traditional CRF-based (supervised) approach (i.e., F-score of 65.4% vs. 64.2%). Finally, we compare our proposed approach to the official submission for the IJCNLP-2008 Bengali NER shared task and achieve an overall improvement of F-score 11.26% with respect to the best official system.
Funder
ADAPT Centre at DCU
Science Foundation Ireland
Indian Statistical Institute, Kolkata, India
Publisher
Association for Computing Machinery (ACM)
Reference35 articles.
1. Andrew Eliot Borthwick. 1999. A Maximum Entropy Approach to Named Entity Recognition. Ph.D. Dissertation. New York University New York NY. Andrew Eliot Borthwick. 1999. A Maximum Entropy Approach to Named Entity Recognition. Ph.D. Dissertation. New York University New York NY.
2. A unified architecture for natural language processing
3. Ronan Collobert Jason Weston Léon Bottou Michael Karlen Koray Kavukcuoglu and Pavel Kuksa. 2011. Natural language processing (almost) from scratch. Journal of Machine Learning Research 2493--2537. http://dl.acm.org/citation.cfm?id=1953048.2078186. Ronan Collobert Jason Weston Léon Bottou Michael Karlen Koray Kavukcuoglu and Pavel Kuksa. 2011. Natural language processing (almost) from scratch. Journal of Machine Learning Research 2493--2537. http://dl.acm.org/citation.cfm?id=1953048.2078186.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献