In their case, paths are mapped onto pairs representing a dependency relation r and the end word w (see the discussion in Section 2): Any plausible and computationally feasible function can be used as basis mapping.
in this article we restrict ourselves to models which use a word-based basis mapping.