On 20 Feb 2015 at 17:47:20, Jens Østergaard Petersen ([log in to unmask]) wrote:
On 20 Feb 2015 at 17:06:52, Martin Holmes ([log in to unmask]) wrote:The obvious way of doing it is to apply canonical decomposition to both
the search string and the searched text before doing the search; but
you'd have to reconstruct the precise offsets in the original text to
get correct results. But that doesn't account for differences introduced
by compatibility normalization (decomposition of diacritics into
component glyphs). If you put this into Chocolat:
woffle
and then search for "woffle", does it find it?Yes. So do the other apps I mentioned.
Jens