9

This question already has an answer here:

So pursuant to the monumental task we have to clean up the and tags, we've taken to putting the following notice in the tag wiki excerpts:

Do not use this tag. Click "learn more" for better alternatives.

This, however, has not stopped people from adding more questions to the tags, which makes an already difficult task more difficult as more questions keep getting added.

I was under the assumption that blacklisting not only locked a tag, but blew it away from all existing tags, but after talking to people in Teachers' Lounge, I've found out that blacklisting and burninating are two separate actions: the former locks the tag, the latter kills the tag on all existing questions.

Just locking the and tags would help out a ton: it'd at least let us to freeze their usage while we stort out the 1500 questions already tagged with them.

So can we get these two tags blacklisted, but not burninated?

marked as duplicate by yannis Sep 24 '16 at 16:59

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • 1
    +1 for the puppy. How can you deny that face? :) – Robert Harvey Sep 23 '11 at 19:47
2

Unfortunately, we cannot simply "lock" the tags from future use without obliterating them. It causes ruckus and befuddlement as a person will see that not only is a tag quite voluminous, but it is also available on the tag suggestion list, and yet if they try to use it, they are barred.

I've followed this up with a new question detailing what we could do to tackle this massive tag job.


I'm very much not a dog person, anyway.

  • 1
    First you decline the request, then you rub salt in the wound. A thousand ಠ_ಠ upon you! – user8 Sep 30 '11 at 17:19
  • Should have used tired kitten – Philip Oct 3 '11 at 20:05
  • Wow, when I hear a software developer say that they cannot satisfy a requirement, I wonder whether it is something that is really impossible, or if they just can't think of an solution off the top of their head? It's not like you were asked to solve N-Sat in polynomial time :-) – Jay Elston Oct 6 '11 at 3:40