Triple
T13653641
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | GB Theory |
E326800
|
entity |
| Predicate | hasPrinciple |
P1757
|
FINISHED |
| Object | Bounding Principle |
E326798
|
NE FINISHED |
How this triple was built (2 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 Principle | Statement: [GB Theory, hasPrinciple, Bounding Principle]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bounding Principle Context triple: [GB Theory, hasPrinciple, Bounding Principle]
-
A.
Bounding Theory
chosen
Bounding Theory is a subtheory within Government and Binding Theory in generative linguistics that constrains how far syntactic elements can move in a sentence.
-
B.
Bounds
Bounds is the maiden surname of Lillian Disney, the wife of Walt Disney and a key figure in the early Disney family history.
-
C.
Barankin bound
The Barankin bound is a fundamental lower bound in statistical estimation theory that generalizes and can be tighter than the Cramér–Rao bound for the variance of unbiased estimators, especially in non-regular or finite-sample settings.
-
D.
Dirichlet principle
The Dirichlet principle is a foundational concept in potential theory and the calculus of variations that asserts certain boundary value problems can be solved by finding a function minimizing an associated energy integral.
-
E.
Accola–Maclachlan bound
The Accola–Maclachlan bound is a refinement in algebraic geometry that gives an improved upper limit on the size of the automorphism group of a compact Riemann surface (or algebraic curve), sharpening the classical Hurwitz bound in certain cases.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d8076d8270819092afc2f0e9c359a8 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbc60ace048190a4b92310ba272bd1 |
completed | April 12, 2026, 4:19 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f78affa3c481909dba71e2ce9f44c1 |
completed | May 3, 2026, 5:50 p.m. |
Created at: April 9, 2026, 9:52 p.m.