Triple
T6991403
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thompson's algorithm for regular expression matching |
E162093
|
entity |
| Predicate | usesOperation |
P9818
|
FINISHED |
| Object | Kleene star |
E601578
|
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: Kleene star | Statement: [Thompson's algorithm for regular expression matching, usesOperation, Kleene star]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kleene star Context triple: [Thompson's algorithm for regular expression matching, usesOperation, Kleene star]
-
A.
Kleene star
chosen
The Kleene star is a fundamental operation in formal language theory and regular expressions that denotes the set of all finite concatenations (including the empty string) of a given symbol or pattern.
-
B.
Kleene
Kleene is a surname most notably associated with American mathematician Stephen Kleene, a pioneer in recursion theory and mathematical logic.
-
C.
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.
-
D.
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.
-
E.
Kleene hierarchy
The Kleene hierarchy is a classification of sets and predicates in arithmetic and recursion theory based on their definability and complexity, introduced by logician Stephen Kleene.
- 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_69c761d6ed5481909ccf1650fe6dc747 |
completed | March 28, 2026, 5:06 a.m. |
Created at: March 27, 2026, 2:32 p.m.