in reply to Comparing likeness of two strings
The String::Approx module uses Levenshtein distance for its matching. According to the docs, the latest version is "2-3 times faster" than the previous one. Give it a try.
Do not rebuke them with harsh words ... but rather lead them gently - with URLs - so that they may learn wisdom.