Given an input sentence x = w 1 ...w n , we denote its POS tag sequence by t = t 1 ...t n , where t i ∈ T , 1 ≤ i ≤ n, and T is the POS tag set.
pOS tagging is traditionally considered as a supporting task for dependency parsing.