For every possible link l (line 9), the algorithm produces a new alignment a and updates the phrase set by calling a procedure UPDATE(f , e, a, l, B, w) (lines 10-11).
using coverage to bridge word alignment and machine translation can hopefully benefit more languages.