If we limit our-Algorithm 1 Optimizing alignment links input: A set of aligned sentence pairs base = <empty sequence>; for several iterations do candidate rules = GenerateAllCandidateRules(input, base); base.append(MinCost(candidate rules)) end for selves to 3 children at a time we would attempt to match this node twice: with its children 1,2,3 and 2,3,4.
we pretend to consider two nodes, one with the first set of children, and one with the second, proceeding left to right.