Re: Compatibility decomposition for Hebrew and Greek final letters

From: Markus Scherer <>
Date: Fri, 20 Feb 2015 09:49:20 -0800

On Thu, Feb 19, 2015 at 11:51 PM, Eli Zaretskii <> wrote:

> I think decomposition to NFKD solves these issues, doesn't it?

Not completely. Judging from your question, you expected more mappings than
NFKD has. You might want to try the mappings that are used as input for
deriving the DUCET (default Unicode collation):

For a character-based search, you should still try to work with canonical
equivalence, for example by applying the FCD check and normalizing when
that fails.

Thanks. I've studied that already, and I do know that collation data
> can be used for search. But it's still a lot of data that I'd like to
> avoid loading, if possible.

Sure, as I said, it depends on what you need and want.

FYI, the ICU data file corresponding to the DUCET is about 160kB (for UCA
7.0) and could be reduced if limited to one specific use case, but the
collation and string-search code is large and complex.

Best regards,

Unicode mailing list
Received on Fri Feb 20 2015 - 11:50:50 CST

This archive was generated by hypermail 2.2.0 : Fri Feb 20 2015 - 11:50:50 CST