Triple
T6991731
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Regular Expression Search Algorithm |
E162100
|
entity |
| Predicate | usesConcept |
P531
|
FINISHED |
| Object | nondeterministic finite automaton |
E269915
|
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: nondeterministic finite automaton | Statement: [Regular Expression Search Algorithm, usesConcept, nondeterministic finite automaton]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: nondeterministic finite automaton Context triple: [Regular Expression Search Algorithm, usesConcept, nondeterministic finite automaton]
-
A.
NFA
chosen
NFA is a common abbreviation for the National Firearms Act, a U.S. federal law regulating certain classes of firearms and related devices.
-
B.
DFA
DFA is an online advertising management and ad-serving platform originally developed by DoubleClick and later integrated into Google's marketing and ad technology stack.
-
C.
DFSA
The DFSA is the independent financial services regulator for the Dubai International Financial Centre, overseeing and enforcing standards for banking, securities, insurance, and related financial activities.
-
D.
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.
-
E.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
- 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.