Important Notice: Our web hosting provider recently started charging us for additional visits, which was unexpected. In response, we're seeking donations. Depending on the situation, we may explore different monetization options for our Community and Expert Contributors. It's crucial to provide more returns for their expertise and offer more Expert Validated Answers or AI Validated Answers. Learn more about our hosting issue here.

Is transitive consistency maintained by the UCA?

April 26, 2017consistency maintained transitive uca

0

Posted

Is transitive consistency maintained by the UCA?

1 Answer

0

Posted

Yes, for any strings A, B, and C, if A < B and B < C, then A < C. However, implementers must be careful to produce implementations that accurately reproduce the results of the Unicode Collation Algorithm as they optimize their own algorithms. It is easy to perform careless optimizations — especially with Incremental Comparison algorithms — that fail this test. Other items to check are the proper distinction between the bases of accents. For example, the sequence should compare as less than ; this is a secondary distinction, based on the weighting of the accents, which must be correctly associated with the primary weights of their respective base letters.