Triple

T6398346
Position Surface form Disambiguated ID Type / Status
Subject UTR #29 E143995 entity
Predicate relatedTo P37 FINISHED
Object Unicode Line Breaking Algorithm
The Unicode Line Breaking Algorithm is a standard specification that defines how to determine valid line break opportunities in text encoded with Unicode, ensuring consistent and readable text layout across different systems and languages.
E590953 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: Unicode Line Breaking Algorithm | Statement: [UTR #29, relatedTo, Unicode Line Breaking Algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Unicode Line Breaking Algorithm
Context triple: [UTR #29, relatedTo, Unicode Line Breaking Algorithm]
  • A. Unicode bidirectional algorithm
    The Unicode bidirectional algorithm is a core text-processing method that determines the correct display order of mixed left-to-right and right-to-left scripts, such as Latin and Arabic, in digital text.
  • B. Grapheme_Cluster_Break
    Grapheme_Cluster_Break is a Unicode text segmentation property used to determine how sequences of code points form user-perceived characters (grapheme clusters) for operations like cursor movement and text selection.
  • C. Unicode text processing algorithms
    Unicode text processing algorithms are standardized procedures that define how Unicode text is compared, sorted, segmented, normalized, and otherwise manipulated consistently across different systems and languages.
  • D. Unicode Technical Standard #35
    Unicode Technical Standard #35 is a Unicode Consortium specification that defines the Locale Data Markup Language (LDML) and related mechanisms for internationalization, including formatting of dates, times, numbers, and other locale-sensitive data.
  • E. Unicode Technical Standard #10
    Unicode Technical Standard #10 is the specification that defines the Unicode Collation Algorithm, providing a standardized method for comparing and sorting Unicode text across languages and platforms.
  • 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: Unicode Line Breaking Algorithm
Triple: [UTR #29, relatedTo, Unicode Line Breaking Algorithm]
Generated description
The Unicode Line Breaking Algorithm is a standard specification that defines how to determine valid line break opportunities in text encoded with Unicode, ensuring consistent and readable text layout across different systems and languages.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Unicode Line Breaking Algorithm
Target entity description: The Unicode Line Breaking Algorithm is a standard specification that defines how to determine valid line break opportunities in text encoded with Unicode, ensuring consistent and readable text layout across different systems and languages.
  • A. Unicode bidirectional algorithm
    The Unicode bidirectional algorithm is a core text-processing method that determines the correct display order of mixed left-to-right and right-to-left scripts, such as Latin and Arabic, in digital text.
  • B. Grapheme_Cluster_Break
    Grapheme_Cluster_Break is a Unicode text segmentation property used to determine how sequences of code points form user-perceived characters (grapheme clusters) for operations like cursor movement and text selection.
  • C. Unicode text processing algorithms
    Unicode text processing algorithms are standardized procedures that define how Unicode text is compared, sorted, segmented, normalized, and otherwise manipulated consistently across different systems and languages.
  • D. Unicode Technical Standard #35
    Unicode Technical Standard #35 is a Unicode Consortium specification that defines the Locale Data Markup Language (LDML) and related mechanisms for internationalization, including formatting of dates, times, numbers, and other locale-sensitive data.
  • E. Unicode Technical Standard #10
    Unicode Technical Standard #10 is the specification that defines the Unicode Collation Algorithm, providing a standardized method for comparing and sorting Unicode text across languages and platforms.
  • 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_69c008dc56fc81908d43ffcc11d73bdd completed March 22, 2026, 3:21 p.m.
NER Named-entity recognition batch_69c06897ebc48190842d48cce469eba5 completed March 22, 2026, 10:09 p.m.
NED1 Entity disambiguation (via context triple) batch_69c6389bd9f48190af9811cf8cee124e completed March 27, 2026, 7:58 a.m.
NEDg Description generation batch_69c63beaa5408190b4421f49634f3df1 completed March 27, 2026, 8:12 a.m.
NED2 Entity disambiguation (via description) batch_69c63c5f7d508190bd263822cea1b782 completed March 27, 2026, 8:14 a.m.
Created at: March 22, 2026, 4:35 p.m.