To tackle the underflow problem posed when parsing discourses ( §3.3), we borrow the rescaling concept from HMMs (Rabiner, 1990) to extend the probabilistic Earley algorithm.
the probability of each Earley path is scaled by a constant c i each time it passes through a scanned state generating the input symbol x i .