Re: Folding algorithm and canonical equivalence

From: John Cowan (
Date: Sun Jul 18 2004 - 01:15:37 CDT

  • Next message: John Cowan: "Re: Folding algorithm and canonical equivalence"

    Asmus Freytag scripsit:

    > John, you proposed the initial set. Do you have any suggestion here?

    My original submission had only the single-character mappings, not the
    character pair mappings, which are just the result of decomposing the
    precomposed set and don't IMHO make much sense: they are too selective.

    The list predates TR#30; I developed it for the purpose of
    making NFC Latin text minimally legible on an old ASCII-only
    printer. (I simply changed the filtering regex from "LATIN" to
    "LATIN|GREEK|CYRILLIC|HEBREW".) It was not intended to cope with
    partially or fully decomposed text.

    I agree that in the TR#30 context, the Right Thing is to remove the
    character pair mappings altogether, and all of the single-character
    mappings that have canonical decompositions.

    John Cowan
    I come from under the hill, and under the hills and over the hills my paths
    led. And through the air. I am he that walks unseen.  I am the clue-finder,
    the web-cutter, the stinging fly. I was chosen for the lucky number.  --Bilbo

    This archive was generated by hypermail 2.1.5 : Sun Jul 18 2004 - 01:09:28 CDT