Triple
T7665959
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thomas H. Cormen |
E173623
|
entity |
| Predicate | familyName |
P18
|
FINISHED |
| Object | Cormen |
E173623
|
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: Cormen | Statement: [Thomas H. Cormen, familyName, Cormen]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Cormen Context triple: [Thomas H. Cormen, familyName, Cormen]
-
A.
Thomas H. Cormen
chosen
Thomas H. Cormen is a computer scientist and professor emeritus at Dartmouth College, best known as a co-author of the widely used textbook "Introduction to Algorithms."
-
B.
Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
-
C.
The Art of Computer Programming
The Art of Computer Programming is Donald Knuth’s seminal multi-volume work that rigorously analyzes algorithms and data structures, widely regarded as one of the most influential and comprehensive texts in computer science.
-
D.
Ullman
Ullman is a surname most prominently associated with British-American actress, comedian, and singer Tracey Ullman.
-
E.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
- 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_69c699562484819086752091e3164a27 |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c701c1383c8190ab5bf803bd6211a9 |
completed | March 27, 2026, 10:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8a2206664819085c6825e63eadd6f |
completed | March 29, 2026, 3:53 a.m. |
Created at: March 27, 2026, 4 p.m.