We use the superscript, l, for local features as Φ l i (x, y) and g for non-local features as Φ g i (x, y).
then, feature mapping is written as Here, we define: Ideally, we want to determine the labels using the whole feature set as: Algorithm 4.1: Candidate algorithm (parameters: if there are non-local features, it is impossible to find the highest scoring candidate efficiently, since we cannot use the Viterbi algorithm.