Consistency also implies that items are popped off the agenda in increasing order of bounded Viterbi scores: β(e) + h(e) We will refer to this monotonicity as the ordering property of A * (Felzenszwalb and McAllester, 2007).
if all inside items are processed before any derivation items, the subsequent number of derivation items and outside items popped by KA * is nearly identical to the number popped by EXH in our experiments (both algorithms have the same ordering bounds on which derivation items are popped).