Jump to content

Unicode collation algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Babbage (talk | contribs) at 19:59, 26 August 2009 (more infomative first sentence?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Unicode collation algorithm (UCA) is an algorithm defined in Unicode Technical Report #10, which defines a customizable method to compare two strings. These comparisons can then be used to collate or sort text in any writing system and language that can be represented with Unicode.

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.

See also

Tools