This procedure is similar to the one used by Barzilay & Lee (2003) in that we also first identify "backbone nodes" (unambiguous alignments) and then add mappings for which several possibilities exist.
they build lattices, i.e., directed acyclic graphs, whereas our graphs may contain cycles.