Triple
T10018635
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Michael O. Rabin |
E199558
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Rabin–Scott powerset construction
The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
|
E836300
|
NE FINISHED |
How this triple was built (4 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: Rabin–Scott powerset construction | Statement: [Michael O. Rabin, knownFor, Rabin–Scott powerset construction]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Rabin–Scott powerset construction Context triple: [Michael O. Rabin, knownFor, Rabin–Scott powerset construction]
-
A.
Glushkov construction
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.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
-
C.
Thompson's algorithm for regular expression matching
Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
-
D.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
E.
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Rabin–Scott powerset construction Triple: [Michael O. Rabin, knownFor, Rabin–Scott powerset construction]
Generated description
The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Rabin–Scott powerset construction Target entity description: The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
-
A.
Glushkov construction
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.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
-
C.
Thompson's algorithm for regular expression matching
Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
-
D.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
E.
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
- F. None of above. chosen
Provenance (5 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_69ca8315a1a08190ab310f25620f362b |
completed | March 30, 2026, 2:05 p.m. |
| NER | Named-entity recognition | batch_69cdcd4de1588190a89ed575cff0b8c9 |
completed | April 2, 2026, 1:58 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d26aaa38188190aed8c18eccd8a79d |
completed | April 5, 2026, 1:59 p.m. |
| NEDg | Description generation | batch_69d26b84271881909c3a1b8a05e2c8a2 |
completed | April 5, 2026, 2:02 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69d26f50dc008190866f0ba45b671560 |
completed | April 5, 2026, 2:18 p.m. |
Created at: March 30, 2026, 8:53 p.m.