Stanford Parser - Traversing the typed dependencies graph

Posted by pns on Stack Overflow See other posts from Stack Overflow or by pns
Published on 2010-04-26T10:18:03Z Indexed on 2010/04/26 10:23 UTC
Read the original article Hit count: 445

Hello!

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

© Stack Overflow or respective owner

Related posts about stanford-nlp

Related posts about java