Article View: comp.std.internat
Article #706Re: Let's develop ISO sorting rules
From: Markus Kuhn
Date: Mon, 11 Jan 1993 18:02
Date: Mon, 11 Jan 1993 18:02
46 lines
3360 bytes
3360 bytes
hpa@eecs.nwu.edu (H. Peter Anvin N9ITP) writes: >> There are at least a few real world applications (I don't talk about >> trivialities like UNIX ls), e.g. catalogs of international libraries, >> where an _easy_ to understand language independend sorting standard would >> be extremely useful. Why not standardize one for Unicode in an easy >> _implementable_ way? Then let's see, how many people will adopt it and >> will quickly forget their traditional rules. Perhaps even many users >> in Sweden. There are perhaps already some multilingual sorting rules >> common practice, but I know no one that defines an easy implementable >> deterministic and total ordering for ISO 10646 strings. >For this application, I think English sorting order is rather well >established. What the hell is this "English sorting order"? Is it a standard that defines a deterministic total order of all Unicode strings? Where can I get the document that defines it? Perhaps we are speaking about the same idea, an international DEFAULT sorting order, that will be acceptable in many countries. There is no reason, why the USA and China can't share a common sorting order, there won't be any collisions. There won't even be collisions if you add France and Germany. But I don't know that any has been defined yet. If people in Sweden need a different order, than they should get their order, no problem. But it would be a good idea to define a default order that might be easily refered to (e.g. as an ISO standard) and that satisfies the needs of the greatest set of countries for which this is possible with one sorting order. I am sure, that this is not possible with character code based sorting, but that it is possible with a SLIGHTLY more sophisticated algorithm. Why is everyone so uninterested in this idea? I posted already many details of my suggested framework for this standard. It consists of an algorithm and a big table that groups characters that are sorted together (e.g. a, A, and all As with diacritics are identified by this table to belong to one single group). All of the many digit 7 versions in Unicode would be another group. I don't have the experience to create the whole group table and the (low priority ordering within the groups for totality of the relation), but I hope, that the experts for CJK languages will also find suitable sorting groups for these languages. Markus -- Markus Kuhn, Computer Science student -=-=- University of Erlangen, Germany Internet: mskuhn@immd4.informatik.uni-erlangen.de | X.500 entry available --- Wer, wie, was? Wieso, weshalb, warum? Wer nichts fragt bleibt dumm. ---
Technical Details
Message-ID:
<1iscn0EINNhjt@uni-erlangen.de>Path:
arc1-ca.pugleaf.net!sparky!uunet!dtix!darwin.sura.net!bogus.sura.net!howland.reston.ans.net!usc!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!ira.uka.de!fauern!uni-erlangen.de!not-for-mailReferences:
<1iev27EINNmc4@uni-erlangen.de> <maf.726345946@dtek.chalmers.se> <1ihe8gEINNh5q@uni-erlangen.de> <1993Jan8.075233.5262@eecs.nwu.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!dtix!darwin.sura.net!bogus.sura.net!howland.reston.ans.net!usc!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!ira.uka.de!fauern!uni-erlangen.de!not-for-mail From: unrza3@cd4680fs.rrze.uni-erlangen.de (Markus Kuhn) Newsgroups: comp.std.internat Subject: Re: Let's develop ISO sorting rules Message-ID: <1iscn0EINNhjt@uni-erlangen.de> Date: 11 Jan 93 18:02:08 GMT References: <1iev27EINNmc4@uni-erlangen.de> <maf.726345946@dtek.chalmers.se> <1ihe8gEINNh5q@uni-erlangen.de> <1993Jan8.075233.5262@eecs.nwu.edu> Reply-To: mskuhn@immd4.informatik.uni-erlangen.de Organization: Regionales Rechenzentrum Erlangen Lines: 46 NNTP-Posting-Host: cd4680fs.rrze.uni-erlangen.de