Triple

T11302732

Position	Surface form	Disambiguated ID	Type / Status
Subject	Southern Gur languages	`E267635`	entity
Predicate	hasLanguage	`P15`	FINISHED
Object	Moore language 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.	`E917990`	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: Moore language | Statement: [Southern Gur languages, hasLanguage, Moore language]

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Moore language
Context triple: [Southern Gur languages, hasLanguage, Moore language]

A. 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.
B. 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.
C. 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.
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. 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: Moore language
Triple: [Southern Gur languages, hasLanguage, Moore language]

Generated description

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.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Moore language
Target entity description: 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.

A. 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.
B. 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.
C. 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.
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. 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_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_69e50a57366081908a05fc52c5d4074c`	completed	April 19, 2026, 5:01 p.m.
NEDg	Description generation	`batch_69e510f9edb4819097e9fa1ce85504ed`	completed	April 19, 2026, 5:29 p.m.
NED2	Entity disambiguation (via description)	`batch_69e516ac8dec81909c9c1eece372189e`	completed	April 19, 2026, 5:53 p.m.

Created at: April 8, 2026, 9:32 p.m.