3 ms·
Interesting. What would you think about this approach: reduce each character to a standard form which is the same for all characters in the same confusable gro
by _nalply 3y ago
Interesting.
What would you think about this approach: reduce each character to a standard form which is the same for all characters in the same confusable group? Then match all search input to this standard form.
This means "ℍ℮1l೦" is converted to "Hello" before searching, for example.
- wanderingstan 3y agoIt’s been a long time since I wrote this, but I think the issue with that approach is the possibility of one character being confusable with more than one letter. I.e. there may not be a single correct form to reduce to.