Abstract

Named Entity Recognition (NER) is one of the most fundamental tasks in natural language processing (NLP). Different from the widely-used sequence labeling framework in NER, span prediction based methods are more naturally suitable for the nested NER problem and have received a lot of attention recently. However, classifying the samples generated by traversing all sub-sequences is computational expensive during training and very ineffective at inference. In this paper, we propose the FastSpanNER approach to reduce the computation of both training and inferring. We introduce a task of Named Entity Head (NEH) prediction for each word in given sequence, and perform multi-task learning together with the task of span classification, which uses no more than half of the samples in SpanNER. In the inference phase, only the words predicted as NEHs are used to generate candidate spans for named entity classification. Experimental results on the four standard benchmark datasets (CoNLL2003, MSRA, CNERTA and GENIA) show that our FastSpanNER method not only greatly reduces the computation of training and inferring but also achieves better F1 scores compared with the SpanNER method.

Keywords:
Computer science Named-entity recognition Artificial intelligence Task (project management) Benchmark (surveying) Inference Word (group theory) Natural language processing Conditional random field Computation Sequence (biology) Machine learning Algorithm

Metrics

2
Cited By
0.51
FWCI (Field Weighted Citation Impact)
33
Refs
0.66
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Topic Modeling
Physical Sciences →  Computer Science →  Artificial Intelligence
Natural Language Processing Techniques
Physical Sciences →  Computer Science →  Artificial Intelligence
Data Quality and Management
Social Sciences →  Decision Sciences →  Management Science and Operations Research
© 2026 ScienceGate Book Chapters — All rights reserved.