Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Text mining›Cross-Document Entity Tracking — Cross-Document Coreference Resolution
Process / pipeline

Cross-Document Entity Tracking — Cross-Document Coreference Resolution

Cross-Document Entity Coreference Resolution and Tracking · Also known as: cross-document coreference resolution, cross-doc entity linking, Belge Ötesi Varlık Takibi

Cross-document entity tracking, formally known as cross-document coreference resolution, identifies and merges all references to the same real-world entity scattered across a collection of documents. Rooted in the B3 evaluation framework introduced by Bagga and Baldwin (1998) and substantially advanced by the neural joint model of Barhom et al. (2019), the method builds entity clusters that span document boundaries — enabling multi-document understanding, knowledge-base population, and corpus-wide entity analysis.

ScholarGate
  1. Process / pipeline
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Cross-Document Entity Tracking
Coreference ResolutionEntity LinkingInformation ExtractionNamed Entity Recognition

When to use it

Cross-document entity tracking is appropriate when the analysis spans a defined collection of at least ten documents and requires knowing that a name in one document refers to the same entity as a different surface form in another. It is applied in knowledge-base construction (linking mentions to a unified entity record), multi-document summarisation (ensuring the same entity is counted once), news tracking (following a person or organisation across articles), and biomedical literature mining (consolidating gene or protein mentions). Two prerequisites must be satisfied before running this method: NER must have been completed across all documents, and the relevant document set must be explicitly defined. Without these, the method cannot begin.

Strengths & limitations

Strengths
  • Enables entity-level analysis across entire document collections — not just within individual documents.
  • Produces structured entity clusters that serve directly as input to knowledge graphs, event timelines, and multi-document summaries.
  • Neural joint models (Barhom et al., 2019) simultaneously resolve entity and event coreference, capturing richer relational context than earlier pipelined systems.
  • The B3 metric (Bagga & Baldwin, 1998) provides a principled, mention-level evaluation that remains the standard for cross-document coreference benchmarks.
Limitations
  • Requires NER and within-document coreference resolution as completed upstream steps; errors in those steps propagate into the cross-document clusters.
  • The document set must be defined before the analysis begins; the method does not self-select relevant documents.
  • Evaluation requires gold-standard coreference annotations, which are expensive to produce for new domains or languages.
  • Computational cost scales with the number of mention pairs across the collection; very large corpora need approximate indexing strategies.

Frequently asked

What is the difference between within-document and cross-document coreference?

Within-document coreference resolution groups mentions that refer to the same entity inside a single document — for example, linking 'Barack Obama', 'the President', and 'he' within one article. Cross-document coreference extends this to a collection of documents, linking mentions that appear in different documents but refer to the same real-world entity. The cross-document step depends on within-document resolution being completed first.

Why is B3 the standard metric rather than simple accuracy?

Simple accuracy does not handle the cluster structure of coreference well. B3, introduced by Bagga and Baldwin (1998), computes precision and recall for every individual mention by examining the overlap between the predicted cluster containing that mention and the gold cluster. This mention-level view is more informative than chain-level scoring and penalises both over-merging (putting too many mentions in one cluster) and over-splitting (creating too many small clusters).

Can the method work without gold-standard annotations?

It can produce clusters without annotations, but it cannot be rigorously evaluated. Without a gold standard, you can only inspect clusters manually or use indirect proxies such as internal cluster cohesion. For any research or production use where quality guarantees matter, a labelled reference set is necessary to measure B3, MUC, or CEAFe.

How large does the document collection need to be?

The statwise engine requires a minimum of ten documents for the clustering step to be meaningful. With very small collections the number of cross-document mention pairs is too low for cluster quality metrics to be stable. There is no strict upper limit, but very large collections require approximate nearest-neighbour indexing (such as FAISS) to keep computation tractable.

Sources

  1. Bagga, A. & Baldwin, B. (1998). Algorithms for Scoring Coreference Chains. In Proceedings of the LREC 1998 Linguistic Coreference Workshop, pp. 563–566. link ↗
  2. Barhom, S., Shwartz, V., Eirew, A., Bugert, M., Reimers, N. & Dagan, I. (2019). Revisiting Joint Modeling of Cross-document Entity and Event Coreference Resolution. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 4179–4189. link ↗

How to cite this page

ScholarGate. (2026, June 1). Cross-Document Entity Coreference Resolution and Tracking. ScholarGate. https://scholargate.app/en/text-mining/cross-document-entity-tracking

Related methods

Coreference ResolutionEntity LinkingInformation ExtractionNamed Entity Recognition

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • Coreference ResolutionText mining↔ compare
  • Entity LinkingText mining↔ compare
  • Information ExtractionText mining↔ compare
  • Named Entity RecognitionText mining↔ compare
Compare side by side →

Similar methods

Coreference ResolutionEntity LinkingText Coherence ScoringNamed Entity RecognitionMulti-Document SummarizationRelation ExtractionTimeline ExtractionInformation Extraction

Related reference concepts

Information ExtractionDiscourse Processing and CoreferenceInformation ExtractionNatural Language Processing in Clinical DocumentationEvaluation and AnnotationText Clustering

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Cross-Document Entity Tracking (Cross-Document Entity Coreference Resolution and Tracking). Retrieved 2026-07-21 from https://scholargate.app/en/text-mining/cross-document-entity-tracking · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originators
Bagga & Baldwin (1998); Barhom et al. (2019)
Year
1998 (scoring foundations); 2019 (neural joint model)
Type
NLP pipeline — cross-document coreference resolution
Input
A defined set of text documents with completed NER and within-document entity linking
Output
Clusters of entity mentions that refer to the same real-world entity across documents
Difficulty
3
MinDocuments
10
RequiresNormality
No
Related methods
Coreference ResolutionEntity LinkingInformation ExtractionNamed Entity Recognition
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account