This question already has an answer here:
The automatic check I would like to learn about looks like as follows:
question posted (alternatively: voted to close or pushed to close queue),
- Check if asker has linked SO account
- If yes, check 3 of their most recent questions at SO
- For every of above 3 questions, calculate Levenshtein distance of its text to that of to Programmers
- Raise system flag for mod attention (or present blocking message) if distance for a particular question is less than some
What difficulties could be there in getting above check done automatically?
threshold mentioned above can be derived based on a representative set of already identified cross-posts. This set (few hundreds in last half year), in turn, can be retrieved by searching flag database for my flags that are marked helpful and have message containing
- Side note (as this has been asked twice in comments). I am somewhat skeptical on blocking message approach. In theory, this would be ideal solution but I am concerned that if presented with block, some users will try to trick to break through Levenshtein threshold (for example, by adding dots to question text). This may return us back to having to discover them manually. My considerations are similar to those why question ban / serial voting algorithms are not exposed for "direct user testing"