A non-terminal node will not be accessed unless it is an argument of some predicate node(s).
this algorithm runs in a time that is approximately linear to the number of leaf nodes in the tree, i.e., the number of words in the source sentence.