While formulated very differently, one limiting case of our algorithm relates closely to the EXH algorithm of Huang and Chiang (2005).
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).