Triple
T9566670
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Standard ML |
E230804
|
entity |
| Predicate | standardizedIn |
P7508
|
FINISHED |
| Object | The Definition of Standard ML |
E232891
|
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: The Definition of Standard ML | Statement: [Standard ML, standardizedIn, The Definition of Standard ML]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: The Definition of Standard ML Context triple: [Standard ML, standardizedIn, The Definition of Standard ML]
-
A.
The Definition of Standard ML
chosen
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
-
B.
Standard ML of New Jersey
Standard ML of New Jersey is a well-known, optimizing compiler and interactive environment for the Standard ML programming language, widely used in research and teaching.
-
C.
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.
-
D.
Standard ML
Standard ML is a statically typed functional programming language with type inference and a formal semantics, widely used in programming language research and teaching.
-
E.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
- 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_69ca847f22188190a56e4a97625bef22 |
completed | March 30, 2026, 2:11 p.m. |
| NER | Named-entity recognition | batch_69cd996df4f08190b19bbaefb10a9789 |
completed | April 1, 2026, 10:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d17900ae2c819087a83f6c74a59afc |
completed | April 4, 2026, 8:48 p.m. |
Created at: March 30, 2026, 8:04 p.m.