We definitely need at least one tag to cover randomized algorithms (that use randomness to do something) and one for random generators (that produce (pseudo)randomness).
For randomized algorithms, we have randomized-algorithms, and more specific tags such as random-walks, random-graphs, sampling, etc. This seems fine to me.
For random generators, we have a ...
If there is any distinction between hash(es) and hashing, the differences are small in the context of computer science. We usually study hash functions to do hashing, and hashing is impossible without hash functions.
Therefore, it is reasonable to link the two as synonyms. Following our usual conventions and to emphasize the algorithmic focus, I'd propose ...
I think finite-automata is specific enough, even for questions that aim towards getting a DFA. That is because determinism is (usually) not the issue; every NFA can be algorithmically converted into a DFA. The issue is finding any finite automaton.
For questions that specifically deal with nondeterminism, we already have nondeterminism (which can be used ...
In the context of CS, "Big-Oh Notation" is probably a synonym of "Landau Notation", even though there is more than O to Landau notation. I'd propose to get rid of the extra tag.
Both are subsets of asymptotics, which covers different types of bounds and limit processes. I think it makes sense to keep the different tags.
I would say applications of graphs in CS do not fall in under graph theory as a mathematical field (research area), e.g. all the A* questions should be labeled graph.
On the other hand, questions regarding graph classes and their complexity (recognition, modification, operations etc.), as well as classical problems like chromatic number etc., should ...
I propose to create the synonym computability ← recursion-theory
The terms may come from different schools, but as far as I know, describe the same field. In particular, a function is recursive (in the sense of this theory) if and only if it is computable.
FWIW, Wikipedia does not seem to separate the terms.
(We may want to go computability-theory ← ...
Not that this really adds a lot, but it at least gives a place for people to vote in favour of discarding graph-algorithms and using algorithms + graphs.
My perspective is that this is the more flexible route. We need a tag for algorithms (of course), and a tag for things-to-do-with-graphs (side note, I still think it's productive to have separate graph-...
I recommend introducing the two tags os-kernel and kernel-functions,
and then introducing a tag synonym kernel -> os-kernel.
I do not think we need a special tag for "kernel" in the context of parametrized complexity. That's a niche topic and I don't think we need such a specialized tag. As far as I can tell, we don't currently have any questions like ...
The nuance may have more to do with grammar. Parser is a noun. Parsing is a gerund (a way in english of turning a verb into either a noun or an adjective.) Parsing is the action that a parser does. We haven't been completely consistent in our choices, but we seem to use gerunds only when the real noun sounds stupid/unnatural. In this case the real noun ...
Implemented on Sep 21, 2016
About the tag graph-algorithms
Create synonym graphs ← graph-algorithms and add algorithms if not already present.
What about tags random and randomness?
Create synonym. randomness ← random
Tags: network-flow, max-flow
Create synonym network-flow ← max-flow.
Do we need both cluster and clustering tags?
Create synonym ...
I think we mostly have to differentiate between partitions of integers and sets. The latter appears in many contexts in CS but we have other tags to clarify the context. Therefore, I suggest the following.
Create tag integer-partitions.
Partitions of an integer n are different ways of writing n as sum of smaller integers.
partitions ← partition
I don't get the tag scoping either, variable-binding is fine for that question. I'm not convinced we need scoping at all and I'd prefer variable-scope if we introduce a synonym.
The proper tag name is variable-binding and not name-binding, because variables aren't always named.
I speak a domain expert as a (former) programming language theoretist and also ...
Back in the day, we decided to use the plural of things as tag. I created a synonym matrix → matrices.
FWIW, note that every user with sufficient reputation can suggest synonyms:
You would then have to lobby on Meta or in chat to collect a couple of approval votes. Or have a mod hammer-approve the synonym. :D
Looking through questions tagged numeral-representations and questions tagged number-formats, I do see a difference: numeral-representations is almost exclusively about representations of integers (17/19 about integers, 2/19 about floating point), whereas number-formats is evenly spread (31/64 about floating point).
I definitely agree that we should have a ...
I tend to use “performance” to mean run time, whereas “efficiency” applies to any resource: CPU time, memory, power…
Since optimizing for efficiency is usually a compromise, I don't think efficiency makes sense as a tag. Use performance for run time efficiency, power-consumption for power efficiency, etc.
Since most questions tagged efficiency are about ...
Yes, in my opinion max-flow should be a synonym of network-flow.
There's really no difference between them, as they are currently being used:
We currently have only 4 questions tagged max-flow. 3 out of 4 of those are also tagged network-flow.
Meanwhile, almost all questions tagged network-flow are actually about finding a maximum flow.
While in ...
I would vote to keep max-flow. Max-flow should apply to a strict subset of network-flow questions. We also have shortest-path, which is another class of network-flow algorithms. It has 151 uses, which is more than double what we have on network-flow.
Shortest path problems can be viewed as specializations of the minimum cost flow problem with costs but ...
Some stats: there are 145 questions tagged hash, 121 of which not tagged hashing as well, and 55 questions tagged hashing, 31 of which not tagged hash as well. This seems to suggest that they are used differently.
One attempt at a distinction:
hash may refer to (mathematical) hash functions themselves. Is this hash function universal? What properties does ...
I propose we merge the tags, without any additional cleanup and have number-formats as the main tag.
Rationale: While @Gilles notes that the tag numerical-representations is almost exclusively about representing integers and the number-formats is about even on integers vs floats, I think this distinction better made clear by adding other tags, such as ...
Now that there are no questions with the tag, it will disappear from the list of tags overnight.
Moderators can make it a synonym of terminology but I don't see a compelling reason to do so.
Stack Exchange staff can blacklist it, but they'll want more evidence of misuse than 6 occurrences (it was introduced in 87051 as far as I can tell).
I looked at the questions with dbms, and all of them were about databases. Since I saw no one disagreeing with this part of the proposal, I went ahead with merging them and making dbms a synonym of databases
As for databases vs. database-theory, we could merge databases into database-theory without making a synonym. This means that all current questions ...