The fragmentation step, however, becomes much more involved since we now face a choice of multiple parse hyperedges at each node.
it becomes nondeterministic how to "cut" a forest into tree fragments, which is analogous to the non-deterministic pattern-match in forest-based decoding (Mi et al., 2008).