Stanford Parser - Traversing the typed dependencies graph

Question

Basically I want to find a path between two NP tokens in the dependencies graph. However, I can't seem to find a good way to do this in the Stanford Parser. Any help?

Thank You Very Much

Answer 1

The Stanford Parser just returns a list of dependencies between word tokens. (We do this to avoid external library dependencies.) But if you want to manipulate the dependencies, you'll almost certainly want to put them in a graph data structure. We usually use jgrapht: http://jgrapht.sourceforge.net/