Last modified: 2012-03-03 17:03:38 UTC
As discussed at URL, AntiSpoof is too aggressive because it's only a one-pass
normalization. For instance, L = i because L = l = I = i. A number of users
have complained because they couldn't sign up with their new name anymore, and
doubtless many others have been distressed to find name after name "taken". The
reasonable solution, again as discussed in the URL, would be using the
normalization as a first pass, and then doing a more intensive pairwise
comparison to figure out whether the specific characters are similar
non-transitively. L = l and maybe l = i, but L != i.
Is this still relevant? I haven't heard complaints about too-aggressive matching, only not-aggressive-enough matching (c.f. imposter series on checkuser-l etc).
Also, the URL is dead.
Of course you haven't heard complaints about too-aggressive matching, because the affected users are unregistered. They either picked a different name and forgot about it, or gave up. Not-aggressive-enough matching will only hurt registered users, and in particular established users who trolls want to impersonate, so they'll be much more likely to make a fuss.
(In reply to comment #3)
> URL fixed.
I tested this, with the same result as initially reported. I'm not sure the must-contain-letters rule makes a lot of sense. What was the original motivation?
I don't know. I assume someone was just throwing together some rules and picked whatever seemed to make sense at the time. There are a heck of a lot of Unicode code blocks. For a couple of years it was blocking all [[hangul]] names by mistake, IIRC.