Unicode Line Breaking Algorithm
E590953
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Unicode Line Breaking Algorithm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6398346 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
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.
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
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
Unicode standard component
ⓘ
text layout algorithm ⓘ |
| abbreviation | UAX #14 NERFINISHED ⓘ |
| allows |
tailoring for specific languages
ⓘ
tailoring for specific typographic conventions ⓘ |
| appliesTo |
Unicode-encoded text
ⓘ
bidirectional text ⓘ multilingual text ⓘ |
| conformsTo | Unicode Standard versioning policy ⓘ |
| definedIn | Unicode Standard Annex #14 NERFINISHED ⓘ |
| governs |
treatment of combining character sequences for line breaking
ⓘ
treatment of emoji for line breaking ⓘ treatment of ideographic characters for line breaking ⓘ treatment of line and paragraph separators ⓘ treatment of punctuation for line breaking ⓘ treatment of soft hyphens ⓘ treatment of spaces for line breaking ⓘ treatment of zero width joiner ⓘ treatment of zero width non-joiner ⓘ treatment of zero width space ⓘ where lines may break in a sequence of Unicode code points ⓘ |
| hasPurpose |
to determine valid line break opportunities in Unicode text
ⓘ
to ensure consistent line breaking behavior across platforms ⓘ to improve readability of text layout ⓘ |
| hasScope |
language-independent default line breaking rules
ⓘ
platform-independent line breaking behavior ⓘ |
| hasStatus | normative specification ⓘ |
| influences |
PDF rendering engines
ⓘ
e-book readers ⓘ text layout engines ⓘ web browsers ⓘ word processors ⓘ |
| partOf | Unicode Standard NERFINISHED ⓘ |
| relatedTo |
Unicode Bidirectional Algorithm
NERFINISHED
ⓘ
Unicode Normalization Algorithm NERFINISHED ⓘ Unicode Text Segmentation (UAX #29) NERFINISHED ⓘ |
| standardizedBy | Unicode Consortium NERFINISHED ⓘ |
| updatedWith | new versions of the Unicode Standard ⓘ |
| usedBy |
CSS line-breaking properties
NERFINISHED
ⓘ
ICU text layout libraries ⓘ operating system text rendering APIs ⓘ |
| usesConcept |
combining marks handling
ⓘ
indirect line breaks ⓘ line break classes ⓘ line breaking rules ⓘ mandatory line breaks ⓘ non-breaking spaces ⓘ pair table of line break classes ⓘ prohibited line breaks ⓘ word joiner characters ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Unicode Line Breaking Algorithm Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.