Triple
T4424973
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Haskell |
E95186
|
entity |
| Predicate | hasImplementation |
P3697
|
FINISHED |
| Object | Glasgow Haskell Compiler |
E166040
|
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: Glasgow Haskell Compiler | Statement: [Haskell, hasImplementation, Glasgow Haskell Compiler]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Glasgow Haskell Compiler Context triple: [Haskell, hasImplementation, Glasgow Haskell Compiler]
-
A.
GHC
chosen
GHC is the Gauhati High Court, the principal judicial authority for the Indian state of Assam and certain neighboring states in the Northeast region.
-
B.
Haskell
Haskell is a statically typed, purely functional programming language known for its strong type system, lazy evaluation, and use in both academic research and industry.
-
C.
Haskell Institute
Haskell Institute was an educational institution in Kansas historically known for its Native American student body and athletic programs, where legendary basketball coach Phog Allen once worked.
-
D.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- 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_69b3453c2a0c8190926b574c90766db9 |
completed | March 12, 2026, 10:59 p.m. |
| NER | Named-entity recognition | batch_69b3554ca5208190ba2661616dcf071c |
completed | March 13, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b5f62f7eb88190a02669845126e790 |
completed | March 14, 2026, 11:58 p.m. |
Created at: March 12, 2026, 11:30 p.m.