Triple

T3094287
Position Surface form Disambiguated ID Type / Status
Subject Government and Binding Theory E64555 entity
Predicate hasModule P12988 FINISHED
Object Bounding Theory
Bounding Theory is a subtheory within Government and Binding Theory in generative linguistics that constrains how far syntactic elements can move in a sentence.
E326798 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: Bounding Theory | Statement: [Government and Binding Theory, hasModule, Bounding Theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Bounding Theory
Context triple: [Government and Binding Theory, hasModule, Bounding Theory]
  • A. Grothendieck inequality
    The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
  • B. Poincaré inequality
    The Poincaré inequality is a fundamental result in functional analysis and partial differential equations that bounds the average oscillation of a function by the size of its gradient, playing a key role in Sobolev space theory and the study of elliptic problems.
  • C. Carathéodory’s theorem in convex geometry
    Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
  • D. Cramér–Rao bound
    The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
  • E. Nash embedding theorem
    The Nash embedding theorem is a fundamental result in differential geometry that shows any Riemannian manifold can be isometrically embedded into some Euclidean space, thereby realizing abstract curved spaces as concrete subsets of standard Euclidean space.
  • 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: Bounding Theory
Triple: [Government and Binding Theory, hasModule, Bounding Theory]
Generated description
Bounding Theory is a subtheory within Government and Binding Theory in generative linguistics that constrains how far syntactic elements can move in a sentence.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Bounding Theory
Target entity description: Bounding Theory is a subtheory within Government and Binding Theory in generative linguistics that constrains how far syntactic elements can move in a sentence.
  • A. Grothendieck inequality
    The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
  • B. Poincaré inequality
    The Poincaré inequality is a fundamental result in functional analysis and partial differential equations that bounds the average oscillation of a function by the size of its gradient, playing a key role in Sobolev space theory and the study of elliptic problems.
  • C. Carathéodory’s theorem in convex geometry
    Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
  • D. Cramér–Rao bound
    The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
  • E. Nash embedding theorem
    The Nash embedding theorem is a fundamental result in differential geometry that shows any Riemannian manifold can be isometrically embedded into some Euclidean space, thereby realizing abstract curved spaces as concrete subsets of standard Euclidean space.
  • 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_69ad857c97d88190b26f9b1c90839c77 completed March 8, 2026, 2:19 p.m.
NER Named-entity recognition batch_69ada239a8c88190a746892b56ee7e02 completed March 8, 2026, 4:22 p.m.
NED1 Entity disambiguation (via context triple) batch_69b20370aba48190a31ec25bca0a4727 completed March 12, 2026, 12:06 a.m.
NEDg Description generation batch_69b2046f76488190adef6685544b080e completed March 12, 2026, 12:10 a.m.
NED2 Entity disambiguation (via description) batch_69b2054bca388190ad40b2303ac96373 completed March 12, 2026, 12:14 a.m.
Created at: March 8, 2026, 3:03 p.m.