On Nov 29, 2008, at 9:18 AM, James A. Donald wrote:
The algorithm is to map all lookalike glyphs to
canonical glyphs
The definition of lookalike glyphs depends on the choice of font and
variant, and Unicode wraps the whole problem in a lovely layer of
hell. If I had to do this, I'd investig
To implement Zooko's triangle, one has to detect names
that may look alike, for example e-gold and e-go1d
This is a lot of code. Has someone already written such
a collision detector that I could swipe?
The algorithm is to map all lookalike glyphs to
canonical glyphs - thus l and 1 are m