Since lattices contain all the likely hypotheses (unlikely hypotheses are pruned during recognition and will not be included in the lattice), conditional entropy for any given input speech signal, x, can be approximated by the conditional entropy of the lattice.
where L i is the corresponding decoded lattice (given speech recognizer parameters) of utterance x i .