Unicode collation algorithm
From Wikipedia, the free encyclopedia
The Unicode collation algorithm (UCA) provides a standard way to put names, words or strings of text in sequence according to the needs of a particular situation.
When used with the default Unicode collation element table (DUCET), this collation method is similar to the European ordering rules for strings in most European languages. In particular, for strings in the Latin alphabet, the ordering is the same as normal sorting order in English and similar languages, since it first looks only at letters stripped of any modifications or diacritical marks.
Note - For a detailed overview of this complex method, full specification can be found at Unicode Technical Standard #10.
In addition to providing a default sorting order, UTS #10 also specifies how to tailor the sorting behaviour to be appropriate for a given locale.
An important open source implementation of UCA is included with the International Components for Unicode, which also supports tailoring. You can see the effects of tailoring and a large number of language specific tailorings in the on-line ICU Locale Explorer.
[edit] See also
[edit] External Links and References
- Unicode Collation Algorithm: Unicode Technical Standard #10
- IBM International Components for Unicode (ICU)
- Mimer SQL Unicode Collation Charts
- [1] Collation of the names of the member states of the United Nations
[edit] Tools
- IBM ICU Locale Explorer contains a demo of UCA collation in ICU.
- sort The GNU implementation of the standard Unix sort utility.
- msort A sort program that provides an unusual level of flexibility in defining collations and extracting keys.
 |
This computer-related article is a stub. You can help Wikipedia by expanding it. |
