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 模型是專爲這種算法設計的，即一棵依賴樹中有大量任務在等待中。