At each step, two coindexed nonterminals are rewritten using the two components of a single rule, such that none of the newly introduced symbols is linked to any symbols already present.
the hierarchical phrase pairs from our above example could be formalized in a synchronous CFG as: where we have used boxed indices to indicate which occurrences of X are linked by ∼.