GLARA: Graph-based labeling rule augmentation for weakly supervised named entity recognition

11Citations
Citations of this article
83Readers
Mendeley users who have this article in their library.

Abstract

Instead of using expensive manual annotations, researchers have proposed to train named entity recognition (NER) systems using heuristic labeling rules. However, devising labeling rules is challenging because it often requires a considerable amount of manual effort and domain expertise. To alleviate this problem, we propose GLARA, a graph-based labeling rule augmentation framework, to learn new labeling rules from unlabeled data. We first create a graph with nodes representing candidate rules extracted from unlabeled data. Then, we design a new graph neural network to augment labeling rules by exploring the semantic relations between rules. We finally apply the augmented rules on unlabeled data to generate weak labels and train a NER model using the weakly labeled data. We evaluate our method on three NER datasets and find that we can achieve an average improvement of +20% F1 score over the best baseline when given a small set of seed rules.

Cite

CITATION STYLE

APA

Zhao, X., Ding, H., & Feng, Z. (2021). GLARA: Graph-based labeling rule augmentation for weakly supervised named entity recognition. In EACL 2021 - 16th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference (pp. 3636–3649). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2021.eacl-main.318

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