We assume that there exists a fixed latent mapping g from argument keys to semantic roles and any such mapping is a-priori equiprobable, P(g) = const.
when generating a label g(k) for a key k, we assume that it can be replaced by any of the remaining R − 1 roles with small probability γ.