Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!mnetor!uunet!seismo!mcvax!enea!kuling!andersa From: andersa@kuling.UUCP (Anders Andersson) Newsgroups: comp.std.internat Subject: Re: What is a byte Message-ID: <477@kuling.UUCP> Date: Wed, 31-Dec-69 18:59:59 EDT Article-I.D.: kuling.477 Posted: Wed Dec 31 18:59:59 1969 Date-Received: Sun, 23-Aug-87 21:43:04 EDT References: <218@astra.necisa.oz> <142700010@tiger.UUCP> <2792@phri.UUCP> <6252@brl-smoke.ARPA> <479@sugar.UUCP> <1384@ogcvax.UUCP> Reply-To: andersa@kuling.UUCP (Anders Andersson) Organization: Uppsala University, Sweden Lines: 17 In article <1384@ogcvax.UUCP> dinucci@ogcvax.UUCP (David C. DiNucci) writes: >I do not know how the final Kanji is actually stored, but it could >conceivably be stored as the sequence of hiragana followed by some >special index telling which "view" of that sequence should be used >when displaying the character. This would seem to take care of some >of the problems discussed in this group. It could cause problems if I'm not sure I understand exactly what problems this solution would take care of. How long can a hiragana word be? The entire word (plus the "view" index) would be the key when looking up the display bitmap, which seems pretty much like using any variable-bytesize character set to represent Kanji. Is this representation particularly suited to sorting and/or searching Japanese text? -- Anders Andersson, Dept. of Computer Systems, Uppsala University, Sweden Phone: +46 18 183170 UUCP: andersa@kuling.UUCP (...!{seismo,mcvax}!enea!kuling!andersa)