点击次数：

所属单位：Yamaguchi Univ.

发表刊物：ICTCSCC

刊物所在地：Korea

关键字：syntax tree, similarity degree, program similarity, bipartite matching

摘要：In this paper, we deal with evaluation method of similarity of two given ordered trees. A similarity computation technique of ordered trees has been proposed, which first transforms two ordered trees respectively to two character strings and then computes the similarity of the two strings by using edit distance of the strings. With respect to this, we propose a method of similarity evaluation by finding maximum matching of the nodes with same depth without doing the transformation of ordered trees. Firstly, we compute node distance from the root for each node and construct individually a bipartite graph for the nodes with same distance. Then we find maximum matching for each bipartite graph and evaluate the similarity of ordered trees based on the number of matched nodes. Finally, we show an example by applying our method to the judgement of similarity for C language programs to show the validity of our method.

论文类型：Research Atricle

学科门类：工学

一级学科：计算机科学与技术

文献类型：JST

卷号：3

期号：2

页面范围：78-82

ISSN号：1745-1361

是否译文：否

发表时间：2013-07-02