traversal tree NLP python. How to use DFS method to look for VP subtree to find the verb that is deepest in the subtree
<p>I am new to the NLP traversal. <a href="http://i.stack.imgur.com/9JBVS.png" rel="nofollow">enter image description here</a></p>

<p>for example the sentence: Scroll bar does not work the best either.
I would like to use  DFS method to look for VP subtree to find the verb that is deepest in the subtree. Could you please help me get these verb? Thanks so much</p>

<p>u can use the stanford cornlp to get the triples</p>

python python-2.7 tree nlp tree-traversal