2026-05-14T23:30:11Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00017185 2025-01-22T23:28:24Z 934:989:1002:1003

A Theoretical Analysis of Tree Edit Distance Measures A Theoretical Analysis of Tree Edit Distance Measures Tetsuji, Kuboyama Kilho, Shin Tetsuhiro, Miyahara Tetsuji, Kuboyama Kilho, Shin Tetsuhiro, Miyahara オリジナル論文 The notion of the tree edit distance provides a unifying framework for measuring distance and finding approximate common patterns between two trees. A diversity of tree edit distance measures have been proposed to deal with tree related problems such as minor containment maximum common subtree isomorphism maximum common embedded subtree and alignment of trees. These classes of problems are characterized by the conditions of the tree mappings which specify how to associate the nodes in one tree with the nodes in the other. In this paper we study the declarative semantics of edit distance measures based on the tree mapping. In prior work the edit distance measures have been not well-formalized. So the relationship among various algorithms based on the tree edit distance has hardly been studied. Our framework enables us to study the relationship. By using our framework we reveal the declarative semantics of the alignment of trees which has remained unknown in prior work. The notion of the tree edit distance provides a unifying framework for measuring distance and finding approximate common patterns between two trees. A diversity of tree edit distance measures have been proposed to deal with tree related problems, such as minor containment, maximum common subtree isomorphism, maximum common embedded subtree, and alignment of trees. These classes of problems are characterized by the conditions of the tree mappings, which specify how to associate the nodes in one tree with the nodes in the other. In this paper, we study the declarative semantics of edit distance measures based on the tree mapping. In prior work, the edit distance measures have been not well-formalized. So the relationship among various algorithms based on the tree edit distance has hardly been studied. Our framework enables us to study the relationship. By using our framework, we reveal the declarative semantics of the alignment of trees, which has remained unknown in prior work. journal article 情報処理学会 2005-12-15 application/pdf 情報処理学会論文誌数理モデル化と応用（TOM） SIG17(TOM13) 46 31 45 1882-7780 AA11464803 https://ipsj.ixsq.nii.ac.jp/record/17185/files/IPSJ-TOM4617005.pdf eng