The first baseline is graph propagation (GP).
we start from uniform posteriors for all the unlabeled nodes in the graph, then for each tag/letter k and each node v we apply the gradient update: until convergence.