Triple
T6991382
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thompson's algorithm for regular expression matching |
E162093
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | regular expression matching 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: regular expression matching algorithm Context triple: [Thompson's algorithm for regular expression matching, instanceOf, regular expression matching algorithm]
-
A.
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.
-
B.
linguistic alignment pattern
A linguistic alignment pattern is the systematic way a language organizes and marks the grammatical roles of participants in events, such as subjects, objects, and agents, across its clause structures.
-
C.
linguistic alignment pattern
A linguistic alignment pattern is a systematic way in which a language organizes and marks the grammatical roles of participants in events (such as subjects, objects, and agents) across its morphology and syntax.
-
D.
Unicode character property
A Unicode character property is an attribute defined by the Unicode Standard that describes a specific aspect of a character’s behavior, appearance, or classification, such as its script, category, or bidirectional behavior.
-
E.
symmetric-key algorithm
A symmetric-key algorithm is a cryptographic method that uses the same secret key for both encryption and decryption of data.
- 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.