Re: [idn] How to match letters

[Eric Brunner-Williams in Portland Maine <brunner@nic-naa.net>]

Ms. Ye,

> I suggest to encode alphabets to ASCII based on ...

In the narrowest of contexts, this list is attempting to to either add a 64th
and possibly other values to a set of 63 values, or map some (larger) set of
values onto a set of 63 values. Alphabets, glyphs, sounds, scripts, languages,
even characters and encodings [0] are ephemera.

This corresponds to the set of arch-1, arch-2, and arch-3 choices in Paul
Hoffman's comparison I-D [1].

In a larger context, this list is tasked with solving a problem stated only in
part [2] in Leslie Daigle's tangled web RFC [3].

The set of 63 values are used to form identifiers, unique within delegated
scope, for a specific classs of a classed lookup service. We could, without
loss of meaning, assign the familiar Mayan 20-count and lunar identifiers,
plus 30 Han characters to these values, as some 63 elements of the 7-bit
ASCII repitorire.

The sense of your proposal, mapping IPA and other exotica (which might as
well be varients of Klingon) into ASCII probably has a place, somewhere.
It isn't a working group attempting the problem stated in [3], or even in
the charter of _this_ working group.

Eric

[0] Encoding identifier management, e.g., universal (ASCII or 10646) or local
    (various) being the only non-ephemeral issue
[1] draft-ietf-idn-compare-0?.txt
[2] e.g., son-of-rfc1036 is not referenced
[3] rfc2825