- From: Steven Pemberton <steven.pemberton@cwi.nl>
- Date: Thu, 18 Aug 2022 20:50:59 +0000
- To: "C. M. Sperberg-McQueen" <cmsmcq@blackmesatech.com>
- Cc: public-ixml@w3.org
> Whenever I have done anything of this kind I have simply loaded a copy > of some version of the Unicode Character Database and looked. But I > like your model of range checks plus exception checks. But with more than 130,000 characters in class L, I am little inclined to load a whole database if it can be encoded more frugally. > I suppose one could view it as an optimization problem: given a > particular distribution of properties, what formulation as ranges + > subtractions + additions will minimize > > (a) the overall size of the representation, or > (b) the expected cost of lookup This is indeed what I am trying to achieve, and wondered if anyone else had attempted it before I put the work in myself... Steven
Received on Thursday, 18 August 2022 20:51:23 UTC