本文提出了一个双向分级聚类的算法同时对不同词性的词进行聚类。在聚类过程中,不同词性的词的聚类交替进行,相互影响。我们以最小描述长度的原理为基础构造了目标函数。为了减小数据稀疏的影响,又提出了修饰度的与修正距离的概念。将此算法应用于汉语形容词- 名词的搭配对,对形容词与名词进行聚类,实验结果显示该算法是有效的。

This paper proposes a bidirctional hierarchical clustering algorithm of simultaneous clustering words of different categories. During clustering ,the process is interactional and alternant . We construct an objective function based on Minimum Description Length (MDL) . In order to solve the problem caused by sparse data two concepts of modificatory degree and modificatory distance are proposed. The further application to clustering Chinese adjectives and nouns demonstrates the algorithm is effective.