We represent part-of-speech tags as another set of graph nodes, where word mentions are connected to the relevant tag over P OS edge type.
the relational paths that connect nodes c and t are evaluated as possible random walk features.