The function we want to approximate is a mapping f from parser configurations to parser actions, where each action consists of a transition and (unless the transition is Shift or Reduce) a dependency type: Here Config is the set of all possible parser configurations and R is the set of dependency types as before.
in order to make the problem tractable, we try to learn a functionf whose domain is a finite space of parser states, which are abstractions over configurations.