liveBook · Manning

Entity resolution

As explained in Knowledge Graphs and LLMs in Action

Entity resolution is the process of determining which records or mentions refer to the same real-world entity.

Entity resolution determines which records or mentions refer to the same real-world entity. In knowledge-graph construction, it links extracted mentions across documents, normalizes them into canonical entities, and supports coherent querying. section 4.5 section 6.1.1

A practical resolution pipeline combines progressively stronger signals:

  • Extract mentions from source documents, including OCR output, and retain links to their originating pages. section 6.1 section 6.1.1
  • Create candidate links when entity strings are identical or sufficiently similar, using domain-aware thresholds. section 6.1.4
  • Combine contextual graph signals such as shared employers, research topics, and multiple related mentions to increase confidence. section 6.1.4
  • Cluster unresolved domain entities with embeddings and hierarchical clustering when names and dictionaries are inadequate. section 6.1 section 6.3

Resolving abbreviated names

“Eleanor Smith” and “E. Smith” become stronger match candidates when both people work for the same university and share a research topic. A surname-only rule would create many false positives, so the baseline combines surname and first-name evidence with graph context. section 6.1.4

Figure 6.2 Simplified KG schema of the Rockefeller Archive Center project
figure

Use the schema diagram to distinguish raw documents and pages, unmerged metagraph mentions, and final resolved entities and relations. section 6.1.1

Resolution reduces ambiguity but does not eliminate it. Production systems still require validation, broader entity coverage, and possible disambiguation against a knowledge base such as WikiData. section 6.1.4 section 6.3

How Knowledge Graphs and LLMs in Action covers it

How deep it goes
Defines resolution and outlines a string- and graph-similarity baseline, but stops short of a full algorithmic treatment.
Examples
Uses abbreviated person names, shared employers, research topics, and clustered occupation embeddings as concrete resolution cases.
What it assumes
Assumes familiarity with graph structure and string similarity while exposing the need for domain-specific thresholds and schemas.
What you can do after
Build it from scratch using candidate string matches, graph context, domain thresholds, and unsupervised clustering.
How it connects
Connects named entity recognition, coreference resolution, relation extraction, normalization, entity disambiguation, and knowledge graphs.

Also explained in

Compare how 5 books explain entity resolution →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Knowledge Graphs and LLMs in Action. The section links point to the parts of the book it draws on.