Triple
T22305334
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Augmented Backus–Naur Form |
E551359
|
entity |
| Predicate | basedOn |
P98
|
FINISHED |
| Object | Backus–Naur Form |
—
|
NE NERFINISHED |
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: Backus–Naur Form | Statement: [Augmented Backus–Naur Form, basedOn, Backus–Naur Form]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Backus–Naur Form Context triple: [Augmented Backus–Naur Form, basedOn, Backus–Naur Form]
-
A.
Backus–Naur Form
chosen
Backus–Naur Form is a formal notation used to define the syntax of programming languages and other formal grammars in a precise, structured way.
-
B.
BNF
BNF is the National Rail station code for Briton Ferry railway station in Neath Port Talbot, Wales.
-
C.
Augmented Backus–Naur Form
Augmented Backus–Naur Form (ABNF) is a standardized, extended version of Backus–Naur Form used to formally specify the syntax of languages and protocols, notably in Internet and communication standards.
-
D.
Van Wijngaarden grammars
Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
-
E.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e11e46c0188190800181a4233f28fe |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f15726b7e48190b7636db01dbb8a40 |
completed | April 29, 2026, 12:56 a.m. |
Created at: April 16, 2026, 8:41 p.m.