Agendas can further be trimmed based on a histogram beam (Saers et al., 2009) or probability beam  compared to the best hypothesisâ.
we have a queue discipline based on the inside probability, and all spans a k where I(a k ) < cI(â) are pruned.