In this case, the information conveyed by having a complete match with the query word's feature set is lower in the case of A's feature set than in case of B's feature set.
we suggest its use as a basis of our similarity measure, the degree of pointwise entropy of having an estimate of m matches, as Information(m, q, c) = − log(P (matches = m)).