Feature Entropy: For an inventory of size N , let there be p f consonants for which a particular feature f (recall that we assume f to be binaryvalued) is present and q f other consonants for which the same is absent.
the probability that a consonant (chosen uniformly at random from this inventory) contains the feature f is p f N and the probability that it does not contain the feature is .