Triple
T11303263
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tampulma language |
E267648
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Moore language |
E917990
|
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: Moore language | Statement: [Tampulma language, relatedTo, Moore language]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Moore language Context triple: [Tampulma language, relatedTo, Moore language]
-
A.
Moore language
chosen
Moore language is a major Gur language of Burkina Faso, spoken primarily by the Mossi people and serving as one of the country’s most widely used lingua francas.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- 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_69d6aac993a08190a6f36445ebaf9a43 |
completed | April 8, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69d7e9a5c3788190ba54eda514b97903 |
completed | April 9, 2026, 6:02 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e55639a5ec8190b979d5a280397f98 |
completed | April 19, 2026, 10:24 p.m. |
Created at: April 8, 2026, 9:32 p.m.