We use both lexicalized features, where all possible pairs (f (x), g(z)) form distinct features, and binary unlexicalized features indicating whether f (x) and g(z) have a string match.
example inputs and outputs are shown in Figure 1.