The closest to a generic solution is Text::Unidecode's unidecode.
An alternative tact would be to measure how different two strings are, and considering the two the same if the difference is sufficiently small. One measure of difference is the Hamming Distance.
In reply to Re^7: One bird, two Unicode names
by ikegami
in thread One bird, two Unicode names
by RCH
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |