Basically, I want to find the path between two NP tokens in the dependency graph. However, I cannot find a good way to do this at Stanford Parser. Any help?
Many thanks
The Stanford parser simply returns a list of dependencies between tokens. (We do this to avoid external library dependencies.) But if you want to manipulate the dependencies, you will almost certainly want to place them in the graph data structure. Usually we use jgrapht: http://jgrapht.sourceforge.net/
Source: https://habr.com/ru/post/1742798/More articles:continuous music on the site - htmlState chain design - javaSQL Express as the main database - .netHow to do simple mathematical operations and display the result in a text field - mathHow to programmatically record the start and end of MVC FileResult to register incomplete downloads? - model-view-controllerJSF skips phases - how to debug this? - jsfКаковы некоторые из ограничений IdeaBlade? - tddHow to make nodes grouped by taxonomy? - viewsHow to enable QDialog for screens like Skype? - qtIs there any other language besides Java that will work everywhere on mobile devices? - javaAll Articles