home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.std.internat
- Path: sparky!uunet!mcsun!news.funet.fi!network.jyu.fi!tarzan!tt
- From: tt@tarzan.jyu.fi (Tapani Tarvainen)
- Subject: Re: Language tagging
- In-Reply-To: hpa@eecs.nwu.edu's message of 8 Jan 93 08: 18:30 GMT
- Message-ID: <TT.93Jan10144618@tarzan.jyu.fi>
- Originator: tt@tarzan.math.jyu.fi
- Sender: news@jyu.fi (News articles)
- Nntp-Posting-Host: tarzan.math.jyu.fi
- Organization: University of Jyvaskyla
- References: <1iddeeINN58g@rodan.UU.NET> <TT.93Jan7085019@tarzan.jyu.fi>
- <1ii6bkINNf6c@rodan.UU.NET> <1993Jan8.081830.15294@eecs.nwu.edu>
- Date: Sun, 10 Jan 1993 12:46:18 GMT
- Lines: 20
-
- In article <1993Jan8.081830.15294@eecs.nwu.edu> hpa@eecs.nwu.edu (H. Peter Anvin N9ITP) writes:
-
- >I'd suggest some form of multiple locales, i.e.
- >setenv LANG ukranian-swedish-ipa-greek-farsi-japanese
-
- >In this model, each of the sorting algorithms would assign sorting
- >values (integers, that may or may not be identical) to each character
- >recognized in that language. Any character undefined (e.g. KANJI HITO
- >for Ukranian) is assigned MAXINT and thus is sorted last. The sort
- >proceeds with the first language as the primary key, second language
- >as the secondary etc. That means not only that the text in the
- >different languages will show up in approximately the order listed,
- >but also that multiscript languages can be easily accommodated.
-
- I like this idea. Can anybody see any serious problems with it?
- (Of course the description above cuts some corners, like multiple
- letters sorting as one, but I can't think of any such problem
- that couldn't be handled in this scheme.)
- --
- Tapani Tarvainen (tt@math.jyu.fi, tarvainen@finjyu.bitnet)
-