yzs
0
Stanford Parser - Traversing the typed dependencies graph
Basically I want to find a pa开发者_如何学Pythonth 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?[详细]
2022-12-27 23:34 分类：问答
![Interactive visualization of a graph in python [closed]](https://www.devze.com/res/2023/04-10/09/92d32fe8c0d22fb96bd6f6e8b7d1f457.gif)
加载中,请稍侯......