In the biparsing algorithm, synchronous rules for constructing hyperedges are not required to be in G, but can be any rules that follow the form defined in Chiang (2007).
the biparsing algorithm can discover new rules that are not in G. Then we collect the translation rules discovered in the hypergraph of the reference translation (line 2), which are rules indicated by hyperedges in the hypergraph.