A Distance for Partially Labeled Trees
In a number of practical situations, data have structure and the relations among its component parts need to be coded with suitable data models. Trees are usually utilized for representing data for which hierarchical relations can be defined. This is the case in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. In those cases, procedures for comparing trees are very relevant. An approximate tree edit distance algorithm has been introduced for working with trees labeled only at the leaves. In this paper, it has been applied to handwritten character recognition, providing accuracies comparable to those by the most comprehensive search method, being as efficient as the fastest.
KeywordsTree edit distance approximate distances qtrees
Unable to display preview. Download preview PDF.
- 2.DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: SODA 1997: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 427–436. Society for Industrial and Applied Mathematics, Philadelphia (1997)Google Scholar
- 4.Garris, M.D., Wilkinson, R.A.: Nist special database 3: Handwritten segmented characters. NIST, Gaithersburg, MdGoogle Scholar
- 5.Habrard, A., Iñesta, J.M., Rizo, D., Sebban, M.: Melody recognition with learned edit distances. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol. 5342, pp. 86–96. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 6.Isert, C.: The editing distance between trees (1999)Google Scholar
- 8.Kuboyama, T., Shin, K., Miyahara, T.: A hierarchy of tree edit distance measures. Theoretical Computer Science and its Applications (2005)Google Scholar
- 10.Marcus, M., Kim, G., Marcinkiewicz, M.A., Macintyre, R., Bies, A., Ferguson, M., Katz, K., Schasberger, B.: The penn treebank: Annotating predicate argument structure. In: ARPA Human Language Technology Workshop, pp. 114–119 (1994)Google Scholar
- 18.Valiente, G.: An efficient bottom-up distance between trees. In: International Symposium on String Processing and Information Retrieval, pp. 212–219. IEEE Computer Society, Los Alamitos (2001)Google Scholar