For our models, gain(a, l) can be obtained in a more efficient way 3 : Note that we restrict that h(a, e, f ) ≥ 0 for all feature functions.
the original terminational condition for greedy search algorithm is: : By introducing gain threshold t, we obtain a new terminational condition: Note that we restrict h(a, e, f ) ≥ 0 for all feature functions.