Then in the second stage, we apply one heuristic rule to extract extra words from the dependency tree.
if a word is in a particular dependency relation 2 , aux, auxpass or cop, with a word that is already in the chain after the first stage, then we include this word in the chain as well.