At the cost of restricting the permissible type sets slightly, we can speed up the greedy procedure further.
we can require that the predicted type set T be connected in some constraint graph over the types-either the co-occurrence graph, the complete graph, or the graph underlying the type system.