The reviewed record of science sign in
Pith

arxiv: 2012.14978 · v1 · pith:T3K36OHY · submitted 2020-12-29 · cs.CL · cs.IR· cs.LG

Few-Shot Named Entity Recognition: A Comprehensive Study

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:T3K36OHYrecord.jsonopen to challenge →

classification cs.CL cs.IRcs.LG
keywords datafew-shotentityschemescomprehensivedifferentimprovein-domain
0
0 comments X
read the original abstract

This paper presents a comprehensive study to efficiently build named entity recognition (NER) systems when a small number of in-domain labeled data is available. Based upon recent Transformer-based self-supervised pre-trained language models (PLMs), we investigate three orthogonal schemes to improve the model generalization ability for few-shot settings: (1) meta-learning to construct prototypes for different entity types, (2) supervised pre-training on noisy web data to extract entity-related generic representations and (3) self-training to leverage unlabeled in-domain data. Different combinations of these schemes are also considered. We perform extensive empirical comparisons on 10 public NER datasets with various proportions of labeled data, suggesting useful insights for future research. Our experiments show that (i) in the few-shot learning setting, the proposed NER schemes significantly improve or outperform the commonly used baseline, a PLM-based linear classifier fine-tuned on domain labels; (ii) We create new state-of-the-art results on both few-shot and training-free settings compared with existing methods. We will release our code and pre-trained models for reproducible research.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Task Decomposition for Efficient Annotation

    cs.CL 2026-06 unverdicted novelty 4.0

    Decomposing annotation tasks using centers from centering theory reduces aggregate inferential load via a degrees-of-freedom model and enables better sub-task allocation.