It is not clear that a decoder such as ours, without the source-tree constraint, would benefit from this method, as building a context-free forest consistent with future language model integration via cubes is expensive on its own.
we see potential integration of both methods in two places: First, the merge-lists algorithm can be used to lazily process any nested for-loops-including vanilla CKYprovided the iterands of the loops can be prioritized.