TheUnicode collation algorithm (UCA) is an algorithm defined in Unicode Technical Report #10, which is a customizable method to produce binary keys fromstrings representing text in anywriting system andlanguage that can be represented withUnicode. These keys can then be efficiently compared byte by byte in order tocollate or sort them according to the rules of the language, with options for ignoring case, accents, etc.^[1]

Unicode Technical Report #10 also specifies theDefault Unicode Collation Element Table (DUCET). This data file specifies a default collation ordering. The DUCET is customizable for different languages,^[1][2] and some such customizations can be found in the UnicodeCommon Locale Data Repository (CLDR).^[3]

An open source implementation of UCA is included with theInternational Components for Unicode, ICU.^[4][5] ICU supports tailoring, and the collation tailorings from CLDR are included in ICU.^[6][2]

• Collation
• ISO/IEC 14651
• European ordering rules (EOR)
• Common Locale Data Repository (CLDR)

• Unicode Collation Algorithm: Unicode Technical Standard #10
• Mimer SQL Unicode Collation Charts

• ICU Locale Explorer An online demonstration of the Unicode Collation Algorithm usingInternational Components for Unicode
• An ICU collation demo
• msort A sort program that provides an unusual level of flexibility in defining collations and extracting keys.

Thisalgorithms ordata structures-related article is astub. You can help Wikipedia byexpanding it.

• v
• t
• e

Thisstandards- ormeasurement-related article is astub. You can help Wikipedia byexpanding it.

• v
• t
• e

• String collation algorithms
• Unicode algorithms
• Collation
• Algorithms and data structures stubs
• Standards and measurement stubs

• Articles with short description
• Short description is different from Wikidata
• All stub articles