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
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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
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/