计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (32): 22-24.DOI: 10.3778/j.issn.1002-8331.2009.32.007

• 博士论坛 • 上一篇    下一篇

依存结构树的计数

胡凤国1,黄 伟1,2,刘海涛1   

  1. 1.中国传媒大学 应用语言学研究所,北京 100024
    2.北京语言大学 汉语水平考试中心,北京 100083
  • 收稿日期:2009-09-07 修回日期:2009-10-09 出版日期:2009-11-11 发布日期:2009-11-11
  • 通讯作者: 胡凤国

Enumeration of dependency structural trees

HU Feng-guo1,HUANG Wei1,2,LIU Hai-tao1   

  1. 1.Institute of Applied Linguistics,Communication University of China,Beijing 100024,China
    2.Chinese Proficiency Test Center(HSK),Beijing Language and Culture University,Beijing 100083,China
  • Received:2009-09-07 Revised:2009-10-09 Online:2009-11-11 Published:2009-11-11
  • Contact: HU Feng-guo

摘要: 树是一种很重要的数据结构,依存结构树是一种特定的树,在语言信息处理领域应用广泛。研究了依存结构树的计数问题。首先给出了依存结构树的形式描述,给出了其5条性质;然后利用n个有序元素的分隔方案和分隔序列给出了依存森林和依存结构树的计数公式;最后给出了8个词语以内的依存结构树的计数结果。

关键词: 依存结构树, 依存结构森林, 分隔方案, 分隔序列

Abstract: Tree is an important data structure.Dependency structural tree is widely used in the field of language information processing.The enumeration of dependency structural trees is put forward.Firstly,the formal description of dependency structural tree and its five properties are given.After that the enumeration formulas of dependency structural tree and dependency structural forest are showed by uses of separation schemes and separation lists of n ordered elements.At last the enumeration results of the dependency structural trees with less than eight word numbers are published.

Key words: dependency structural tree, dependency structural forest, separation scheme, separation list

中图分类号: