Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
A survey on tree edit distance and related problems
Theoretical Computer Science
Melody Recognition with Learned Edit Distances
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Tree Representation in Combined Polyphonic Music Comparison
Computer Music Modeling and Retrieval. Genesis of Meaning in Sound and Music
A distance for partially labeled trees
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
| Hi-index | 0.00 |
Trees are a powerful data structure for representing data for which hierarchical relations can be defined. They have been applied in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. Procedures for comparing trees are very relevant in many task where tree representations are involved. The computation of these measures is usually a time consuming tasks and different authors have proposed algorithms that are able to compute them in a reasonable time, through approximated versions of the similarity measure. Other methods require that the trees are fully labelled for the distance to be computed. In this paper, a new measure is presented able to deal with trees labelled only at the leaves, that runs in O(|TA|×|TB|) time. Experiments and comparative results are provided.