Le mercredi, 16 septembre 2015 à 22:14, Asmus Freytag (t) a écrit : > "N" doesn't mean "narrow" but "neutral" - that is, the width is given by > other consideration.
Ah right ! Thanks. Narrow is Na. So a refined algorithm would be to actually do the summation in each grapheme cluster as I initially wanted to do with the mapping (F, W -> 2), (Na, H -> 1) (N -> 0) and if I get a 0 fallback on 1 or maybe try to make an educated guess according to the script/block. Best, Daniel
