Distantly Supervised Named Entity Recognition using Positive-Unlabeled Learning
About
In this work, we explore the way to perform named entity recognition (NER) using only unlabeled data and named entity dictionaries. To this end, we formulate the task as a positive-unlabeled (PU) learning problem and accordingly propose a novel PU learning algorithm to perform the task. We prove that the proposed algorithm can unbiasedly and consistently estimate the task loss as if there is fully labeled data. A key feature of the proposed method is that it does not require the dictionaries to label every entity within a sentence, and it even does not require the dictionaries to label all of the words constituting an entity. This greatly reduces the requirement on the quality of the dictionaries and makes our method generalize well with quite simple dictionaries. Empirical studies on four public NER datasets demonstrate the effectiveness of our proposed method. We have published the source code at \url{https://github.com/v-mipeng/LexiconNER}.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Named Entity Recognition | BC5CDR (test) | Macro F1 (span-level)59.2 | 80 | |
| Named Entity Recognition | CoNLL KB-Matching 2003 (test) | F1 Score78.44 | 24 | |
| Named Entity Recognition | News | F1 Score77.98 | 21 | |
| Named Entity Recognition | CoNLL2003 String-Matching (test) | F1 Score72.42 | 11 | |
| Named Entity Recognition | BC5CDR Big Dict (test) | F1 Score59.24 | 11 | |
| Named Entity Recognition | EC | F1 Score61.22 | 9 | |
| Named Entity Recognition | CoNLL Dict 2003 (test) | F1 Score76.11 | 8 | |
| Named Entity Recognition | BC5CDR Small Dict (test) | F1 Score70.21 | 8 |