home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!not-for-mail
- From: avg@rodan.UU.NET (Vadim Antonov)
- Newsgroups: comp.std.internat
- Subject: Re: Dumb Americans (was INTERNATIONALIZATION: JAPAN, FAR EAST)
- Date: 1 Jan 1993 19:03:51 -0500
- Organization: UUNET Technologies Inc, Falls Church, VA
- Lines: 29
- Message-ID: <1i2m57INN4vr@rodan.UU.NET>
- References: <1i0oj2INNp4v@life.ai.mit.edu> <1i13rrINNars@rodan.UU.NET> <id.68CW.A16@ferranti.com>
- NNTP-Posting-Host: rodan.uu.net
- Keywords: ISO10646 Unicode
-
- In article <id.68CW.A16@ferranti.com> peter@ferranti.com (peter da silva) writes:
- >In article <1i13rrINNars@rodan.UU.NET> avg@rodan.UU.NET (Vadim Antonov) writes:
- >> We were talking about lexicographical sorting, not abouth phonetics.
- >
- >But lexicographic sorting (actually, lexicograhic ordering) is a minor part of
- >this. Most sorting computers do is algorithmic ordering, to optimise some
- >combination of operations on data structures (searching, for example). The
- >character set is irrelevant there.
-
- Wrong-o. Nobody does numerical sorts since invention of secondary
- indices.
-
- The problem is not in searching -- the problem is in presenting
- the information and in regular expressions ([a-z] - does it include "o?)
-
- >I want a character set that differentiates between parts of speech.
-
- Let's solve simplier problems first. I merely want a character set
- which allows me to use my screen editor without fussing around
- every search pattern i use.
-
- ><para><sentence><phrase>The semantic in <acronym>ASCII</> is <jargon>
- >hard-coded</></><dash><phrase>it is the <phrase>order of letters</>
- >and <phrase>the trivial <jargon>upper-case</> to <jargon>lower-case</>
- >conversion</></></sentence></para>
-
- You got me.
-
- --vadim
-