- From: r12a via GitHub <sysbot+gh@w3.org>
- Date: Wed, 01 Nov 2017 16:51:07 +0000
- To: public-i18n-archive@w3.org
> But two logically distinct characters or grapheme clusters can still look the same or very similar. suggest 'still' -> 'also' > When a pair of graphemes look identical (or very similar), they are called homographs. When a pair of graphemes look similar or are homographs but actually represent logically different characters or character sequences, they are said to be "confusable". This seems to be suggesting that homographs and confusables are different things, and that the logical difference only applies for confusables, which i find confusing. I think this needs more work. btw, for the P example, you may want to say that they actually represent *different* letters of the alphabet, ie. the pronunciation is different from the Latin. It's not just that there are copies of the same letter for each alphabet. -- GitHub Notification of comment by r12a Please view or discuss this issue at https://github.com/w3c/charmod-norm/issues/127#issuecomment-341166394 using your GitHub account
Received on Wednesday, 1 November 2017 16:51:13 UTC