A Tree-Compare Algorithm for Similarity Evaluation 


Vol. 11,  No. 2, pp. 159-164, Apr.  2004
10.3745/KIPSTA.2004.11.2.159


PDF
  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
  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.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals