InfoQ: Does Repository Manager support traversal of dependency tree of arbitrary depth?
InfoQ：RepositoryManager支持遍历任意深度的依赖树吗？
Converting between phrase-structure tree and dependency tree is one of the most important subjects in computational linguistics.
短语结构树与依存树之间的转换是计算语言学重要的研究内容之一。
Oriented to sentimental elements extraction, a dependency tree-based method has been proposed in this paper.
针对情感要素抽取，本文提出了一种基于依存关系的抽取方法。
Oriented to sentimental elements extraction, a dependency tree-based method has been proposed in this paper.
针对情感要素抽取，本文提出了一种基于依存关系的抽取方法。
应用推荐