Converting between phrase-structure tree and dependency tree is one of the most important subjects in computational linguistics.
短语结构树与依存树之间的转换是计算语言学重要的研究内容之一。
Then the restrictive phrase-tree is presented with its compact storage structure that improves the storage and access efficiency in recognition search.
然后介绍了约束词树和它的高效存储结构,这种结构提高了约束词树的存储效率和在识别搜索中的检索效率;
应用推荐