- From: Keld J|rn Simonsen <keld@dkuug.dk>
- Date: Mon, 21 Oct 1996 21:53:08 +0200
- To: Jonathan Rosenne <rosenne@NetVision.net.il>, J.Larmouth@iti.salford.ac.uk, www-international@w3.org
Jonathan Rosenne writes: > The simplest transformation is to decompose all composites and sort all > combining characters that attach to a single base character in binary > order. This guarantees a unique and permanent canonical representation. > An alternative is to replace all those combinations that are defined > with the composite. This transformation is dependent on the version of > the standard, since new composite characters are being discovered from > time to time, but is still satisfactory. The problem with this is that the standard sorting specifications are done on the whole characters, not the "decomposed" composite sequences. Also for that reason it would be advantegous to code the information in the 10646 characters so you have support for sorting. Building on the 10646 standard allows you to draw on all other ISO standardized work building on the standard, and thus to have an aligned set of standard conforming specifications. Keld
Received on Monday, 21 October 1996 15:53:59 UTC