A Tree-Compare Algorithm for Similarity Evaluation


The KIPS Transactions:PartA, Vol. 11, No. 2, pp. 159-164, Apr. 2004
10.3745/KIPSTA.2004.11.2.159,   PDF Download:

Abstract

In the previous researches,tree comparison methods are almost studied in comparing weighted or labeled tree(decorated tree). But in this paper,we propose a tree comparison and similarity evaluation algorithm can be applied to comparison of two normal trees. The algorithm converts two trees into node string using unparser,evaluates similarity and finally return similarity value from 0.0 to 1.0. In the experiment part of this paper,we visually presented matched nodes and unmatched nodes between two trees. By using this tree similarity algorithm,we can not only evaluate similarity between two specific programs or documents but also detect duplicated code.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. Y. Cheol and Y. J. U, "A Tree-Compare Algorithm for Similarity Evaluation," The KIPS Transactions:PartA, vol. 11, no. 2, pp. 159-164, 2004. DOI: 10.3745/KIPSTA.2004.11.2.159.

[ACM Style]
Kim Yeong Cheol and Yu Jae U. 2004. A Tree-Compare Algorithm for Similarity Evaluation. The KIPS Transactions:PartA, 11, 2, (2004), 159-164. DOI: 10.3745/KIPSTA.2004.11.2.159.