斯坦福分析器 - 遍历类型化的依赖关系图 [英] Stanford Parser - Traversing the typed dependencies graph

问题描述

基本上我想在依赖关系图中找到两个NP令牌之间的路径。但是，我似乎无法在斯坦福分析器中找到这样做的好方法。任何帮助？

非常感谢您

解决方案

The Stanford Parser只是返回单词标记之间的依赖关系列表。 （我们这样做是为了避免外部库依赖性。）但是如果你想操纵依赖关系，你几乎肯定会把它们放在图形数据结构中。我们通常使用jgrapht： http://jgrapht.sourceforge.net/

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/

这篇关于斯坦福分析器 - 遍历类型化的依赖关系图的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！