Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The Tree-to-Tree Correction Problem

The Tree-to-Tree Correction Problem The Tree-to-Tree Correction Problem K U O - C H U N G TAI North Carolina State Umverslty, Ralezgh, North Carohna ABSTRACT The tree-to-tree correctmn problem Is to determine, for two labeled ordered trees T and T', the distance from T to T' as measured by the mlmmum cost sequence of edit operaUons needed to transform T into T' The edit operations investigated allow changing one node of a tree into another node, deleting one node from a tree, or inserting a node into a tree An algorithm Is presented which solves this problem m time O(V* V'*LZ* L'2), where V and V' are the numbers of nodes respectively of T and T', and L and L' are the maximum depths respectively of T and T' Possible apphcatmns are to the problems of measuring the similarity between trees, automatic error recovery and correction for programming languages, and determining the largest common substructure of two trees KEY WORDS AND PHRASES CR CATEGORIES tree correction, tree m o d i f i c a t i o n , tree s i m i l a r i t y 3 79, 4A2, 4 22, 5 23, 5 25 1. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

The Tree-to-Tree Correction Problem

Journal of the ACM (JACM) , Volume 26 (3) – Jul 1, 1979

Loading next page...
 
/lp/association-for-computing-machinery/the-tree-to-tree-correction-problem-6oNJUTBK0f

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1979 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/322139.322143
Publisher site
See Article on Publisher Site

Abstract

The Tree-to-Tree Correction Problem K U O - C H U N G TAI North Carolina State Umverslty, Ralezgh, North Carohna ABSTRACT The tree-to-tree correctmn problem Is to determine, for two labeled ordered trees T and T', the distance from T to T' as measured by the mlmmum cost sequence of edit operaUons needed to transform T into T' The edit operations investigated allow changing one node of a tree into another node, deleting one node from a tree, or inserting a node into a tree An algorithm Is presented which solves this problem m time O(V* V'*LZ* L'2), where V and V' are the numbers of nodes respectively of T and T', and L and L' are the maximum depths respectively of T and T' Possible apphcatmns are to the problems of measuring the similarity between trees, automatic error recovery and correction for programming languages, and determining the largest common substructure of two trees KEY WORDS AND PHRASES CR CATEGORIES tree correction, tree m o d i f i c a t i o n , tree s i m i l a r i t y 3 79, 4A2, 4 22, 5 23, 5 25 1.

Journal

Journal of the ACM (JACM)Association for Computing Machinery

Published: Jul 1, 1979

There are no references for this article.