Triple

T1836109
Position Surface form Disambiguated ID Type / Status
Subject Rényi divergence E41069 entity
Predicate relatedTo P37 FINISHED
Object Hellinger distance
Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
E205229 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Hellinger distance | Statement: [Rényi divergence, relatedTo, Hellinger distance]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hellinger distance
Context triple: [Rényi divergence, relatedTo, Hellinger distance]
  • A. Kullback–Leibler divergence
    Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
  • B. Kolmogorov distance
    Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
  • C. Rényi divergence
    Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
  • D. Rényi entropy
    Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
  • E. Shannon entropy
    Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Hellinger distance
Triple: [Rényi divergence, relatedTo, Hellinger distance]
Generated description
Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hellinger distance
Target entity description: Hellinger distance is a statistical measure of dissimilarity between probability distributions, derived from the Euclidean distance between their square-root densities and widely used in probability theory and information geometry.
  • A. Kullback–Leibler divergence
    Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
  • B. Kolmogorov distance
    Kolmogorov distance is a statistical metric that measures the maximum difference between two cumulative distribution functions, commonly used to quantify convergence in distribution and in goodness-of-fit tests.
  • C. Rényi divergence
    Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
  • D. Rényi entropy
    Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
  • E. Shannon entropy
    Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
  • F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69a88647f9388190909bc36e795bdaec completed March 4, 2026, 7:21 p.m.
NER Named-entity recognition batch_69abb028226481908558c11449e1d6b6 completed March 7, 2026, 4:57 a.m.
NED1 Entity disambiguation (via context triple) batch_69adc9b6dc9481908a83e60aee326bc4 completed March 8, 2026, 7:10 p.m.
NEDg Description generation batch_69adcaef04e88190a88f789a6370bafb completed March 8, 2026, 7:15 p.m.
NED2 Entity disambiguation (via description) batch_69adcb8e053c819082a3d4b36afe35be completed March 8, 2026, 7:18 p.m.
Created at: March 4, 2026, 7:33 p.m.