Triple
T6991708
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thompson's algorithm |
E162099
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Glushkov construction |
E632952
|
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: Glushkov construction | Statement: [Thompson's algorithm, relatedTo, Glushkov construction]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Glushkov construction Context triple: [Thompson's algorithm, relatedTo, Glushkov construction]
-
A.
Glushkov construction
chosen
Glushkov construction is a method in automata theory that converts a regular expression into an equivalent nondeterministic finite automaton with a specific position-based structure.
-
B.
Böhm–Jacopini theorem
The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
-
C.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
D.
Kleene
Kleene is a surname most notably associated with American mathematician Stephen Kleene, a pioneer in recursion theory and mathematical logic.
-
E.
Kleene algebra
Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
- 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_69c68856d7808190ab33ee914640281b |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6dbc1f63c8190837cfd71cf5ed613 |
completed | March 27, 2026, 7:34 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c76a161f088190bbc3c4e2815fa929 |
completed | March 28, 2026, 5:41 a.m. |
Created at: March 27, 2026, 2:32 p.m.