Triple
T6991383
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thompson's algorithm for regular expression matching |
E162093
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | NFA construction algorithm |
C6819
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: NFA construction algorithm Context triple: [Thompson's algorithm for regular expression matching, instanceOf, NFA construction algorithm]
-
A.
AC machine model
An AC machine model is a mathematical representation of an alternating current electrical machine that captures its electromagnetic, mechanical, and control-related behavior for analysis, design, and simulation.
-
B.
algorithm
chosen
An algorithm is a finite, well-defined sequence of computational steps or rules designed to solve a specific problem or perform a particular task.
-
C.
formal grammar notation
A formal grammar notation is a precise symbolic system for defining the syntactic structure of languages by specifying how valid strings can be generated from a set of production rules.
-
D.
hierarchy of formal grammars
A hierarchy of formal grammars is an organized classification of grammars into levels based on their generative power and structural constraints, such as the Chomsky hierarchy from regular to recursively enumerable languages.
-
E.
framework in generative grammar
A framework in generative grammar is a theoretical system of principles and formal mechanisms used to model and explain the innate structure and rules underlying human language.
- F. None of above.
Provenance (1 batch)
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. |
Created at: March 27, 2026, 2:32 p.m.