Triple

T7946055
Position Surface form Disambiguated ID Type / Status
Subject Miao languages E184499 entity
Predicate writingSystem P454 FINISHED
Object Pollard script
Pollard script is an alphabetic writing system originally devised in the early 20th century for transcribing various Miao (Hmongic) languages of China.
 E704488 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: Pollard script | Statement: [Miao languages, writingSystem, Pollard script]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Pollard script
Context triple: [Miao languages, writingSystem, Pollard script]
  • A. Pollard
    Pollard is an English-language surname borne by various notable individuals across sports, politics, science, and the arts.
  • B. Cantor–Zassenhaus algorithm
    The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
  • C. Berlekamp–Massey algorithm
    The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
  • D. Selfridge–Conway primality test
    The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
  • E. Blum–Blum–Shub pseudorandom number generator
    The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
  • 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: Pollard script
Triple: [Miao languages, writingSystem, Pollard script]
Generated description
Pollard script is an alphabetic writing system originally devised in the early 20th century for transcribing various Miao (Hmongic) languages of China.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Pollard script
Target entity description: Pollard script is an alphabetic writing system originally devised in the early 20th century for transcribing various Miao (Hmongic) languages of China.
  • A. Pollard
    Pollard is an English-language surname borne by various notable individuals across sports, politics, science, and the arts.
  • B. Cantor–Zassenhaus algorithm
    The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
  • C. Berlekamp–Massey algorithm
    The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
  • D. Selfridge–Conway primality test
    The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
  • E. Blum–Blum–Shub pseudorandom number generator
    The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
  • 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_69ca8291c2008190b1b8832c87814bcf completed March 30, 2026, 2:02 p.m.
NER Named-entity recognition batch_69cb3b29a570819091a2ac185a8d57c4 completed March 31, 2026, 3:10 a.m.
NED1 Entity disambiguation (via context triple) batch_69cbe02faa308190aeba83cc6cb96153 completed March 31, 2026, 2:54 p.m.
NEDg Description generation batch_69cbe4383d0c819085e7c95e7b0be16e completed March 31, 2026, 3:11 p.m.
NED2 Entity disambiguation (via description) batch_69cc34a83cec81908aba7afbaea53449 completed March 31, 2026, 8:55 p.m.
Created at: March 30, 2026, 5:09 p.m.