We first use pattern-matching algorithm of  to convert F c into a translation forest, each hyperedge of which is associated with a constituency to dependency translation rule.
pattern-matching failure 2 at a node v f will cut the derivation path and lead to translation failure.