dependency tree

基本解释

InfoQ: Does Repository Manager support traversal of dependency tree of arbitrary depth?
InfoQ：Repository Manager支持遍历任意深度的依赖树吗？
Converting between phrase-structure tree and dependency tree is one of the most important subjects in computational linguistics.
短语结构树与依存树之间的转换是计算语言学重要的研究内容之一。
The fork/join model is designed for exactly these kinds of algorithms, where you have a large number of tasks waiting in a dependency tree.
fork/join 模型是专为这种算法设计的，即一棵依赖树中有大量任务在等待中。