Re: http://www.unicode.org/reports/tr30/datafiles/DiacriticFolding.txt

From: Peter Kirk (peterkirk@qaya.org)
Date: Tue Jul 20 2004 - 04:09:16 CDT

  • Next message: Simon Montagu: "Re: Folding algorithm and canonical equivalence"

    On 20/07/2004 05:32, John Cowan wrote:

    >Asmus Freytag scripsit:
    >
    >
    >
    >>>Is John Cowan's list supposed to be a complete list of
    >>>foldables for extant Hebrew code points?
    >>>
    >>>
    >>We know its not.
    >>
    >>
    >
    >It lists all the characters which have points embedded in them.
    >If you map all those characters away and delete all explicit points and
    >accents, you have unpointed Hebrew.
    >
    >
    >
    True. On the other hand, if you simply delete all explicit points and
    accents and also apply the folding algorithm including its repeated
    decomposition step, you have unpointed Hebrew without having to list
    these specific characters, which all have canonical decompositions. So
    your list is redundant. 

    -- 
Peter Kirk
peter@qaya.org (personal)
peterkirk@qaya.org (work)
http://www.qaya.org/

    This archive was generated by hypermail 2.1.5 : Tue Jul 20 2004 - 04:13:21 CDT