Unicode collation algorithm

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

Unicode Technical Report #10 also specifies the Default 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 Unicode Common Locale Data Repository (CLDR).^[3]

An open source implementation of UCA is included with the International 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 using International Components for Unicode
• An ICU collation demo
• msort A sort program that provides an unusual level of flexibility in defining collations and extracting keys.

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

• All stub articles