Named Entity Recognition › Summary

Michael BrenndoerferUpdated January 30, 20262 min read
Language AI HandbookAll chapters
Part 6 of 67Sequence Labeling
Chapter 37Named Entity Recognition › Summary
Reading section 16 of 17 · Summary · 2 minSection 16 of 17 · 2 min

Book contents

Section 16 of 17 · 2 min read

Named Entity Recognition › SummaryOne section · Sections in this chapter16 / 17 ↓
Reading tools Definitions & inline links

Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.

Article links

Make inline references clickable

Named Entity Recognition identifies and classifies real-world entity mentions in text. The key concepts from this chapter are:

  • Entity types are organized into taxonomies. Core categories (PER, ORG, LOC) appear in every NER system; extended and domain-specific categories are tailored to application needs. The choice of taxonomy reflects assumptions about what downstream consumers of the extracted data need.
  • NER is framed as sequence labeling using BIO tagging: each token receives a label encoding both entity type and position within a multi-token span. Any sequence labeling model can be applied to NER through this encoding.
  • Boundary detection is hard. Prepositional attachment, titles, possessives, coordination, and abbreviations all create ambiguity about where entity spans begin and end. Annotation guideline inconsistencies compound this difficulty by introducing label noise into training data.
  • Nested entities (an entity span containing another entity) cannot be represented in standard BIO tagging. Span-based models or multi-layer annotation schemes are needed for applications that require nested entity extraction.
  • NER evolved through three paradigm shifts: rule-based systems using gazetteers and hand-written rules (1980s-1990s), statistical CRF systems using hand-engineered features (1990s-2010s), and neural systems using BiLSTM-CRF and then transformer-based architectures (2015-present). Each shift improved F1 by several points, with the shift to transformers being the most impactful.
  • Evaluation uses span-level precision, recall, and F1. Exact match evaluation requires both correct boundaries and correct type; partial match relaxes the boundary requirement. The choice of evaluation scheme can change reported F1 by 5-15 points.
  • CoNLL 2003 and OntoNotes 5.0 are the dominant English NER benchmarks. Performance has improved from roughly 82 F1 (CRF) to above 94 F1 (RoBERTa) over two decades.
  • Multilingual and cross-lingual NER, enabled by multilingual pre-trained models like XLM-RoBERTa, allows zero-shot transfer to low-resource languages. Agglutinative morphology, case-marked languages, and scriptural variation present additional challenges.
  • Domain shift, rare entities, and annotation inconsistencies are the main practical failure modes. Evaluating on in-domain data before deployment is essential. Error analysis should distinguish representation failure, context failure, and label noise as distinct root causes.

The next chapter examines BIO tagging in detail, covering the full family of tagging schemes (BIO, BIOES, BILOU), how to convert between span and tag representations, and how to handle tagging inconsistencies in practice.