For each grammar rule X → α, β in G in , where α contains a token (e.g., "texas") that string matches an entity (e.g., texas) in β, we add two rules to G out : (i) a rule where both occurrences are replaced with the type of the entity (e.g., state), and (ii) a new rule that maps the type to the entity (e.g., STATEID → "texas", texas ; we reserve the category name STATE for the next section).
g out generates recombinant examples that fuse most of one example with an entity found in a second example.