Triple
T13987935
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Subjacency |
E336489
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object | Minimalist Program locality conditions |
E32213
|
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: Minimalist Program locality conditions | Statement: [Subjacency, influenced, Minimalist Program locality conditions]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Minimalist Program locality conditions Context triple: [Subjacency, influenced, Minimalist Program locality conditions]
-
A.
The Minimalist Program
The Minimalist Program is a major theoretical framework in generative linguistics, developed by Noam Chomsky, that seeks to explain the properties of human language through the simplest and most economical principles and mechanisms.
-
B.
Minimalist Program
chosen
The Minimalist Program is a theoretical framework in generative linguistics, developed by Noam Chomsky, that seeks to explain language using the simplest and most economical principles and mechanisms possible.
-
C.
Partial Evaluation and Program Manipulation
Partial Evaluation and Program Manipulation (PEPM) is a specialized conference and research area in computer science focused on techniques for program transformation, optimization, and analysis through partial evaluation and related methods.
-
D.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
-
E.
Notes on Structured Programming
Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
- 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_69d81c639e808190a0e4b4f3d31c6a59 |
completed | April 9, 2026, 9:38 p.m. |
| NER | Named-entity recognition | batch_69de2ea537408190bb9d35963886803f |
completed | April 14, 2026, 12:10 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fbac9604cc819088cde0ad8271ad48 |
completed | May 6, 2026, 9:03 p.m. |
Created at: April 9, 2026, 10:18 p.m.