Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
On the editing distance between unordered labeled trees
Information Processing Letters
Efficient learning of context-free grammars from positive structural examples
Information and Computation
Some MAX SNP-hard results concerning unordered labeled trees
Information Processing Letters
Numerical Similarity and Dissimilarity Measures Between Two Trees
IEEE Transactions on Computers
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Handwritten Digit Recognition through Inferring Graph Grammars. A First Approach
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
The Noisy Subsequence Tree Recognition Problem
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Grammatical Inference Based on Hyperedge Replacement
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Error-Correcting Parsers for Formal Languages
IEEE Transactions on Computers
Error-Correcting Tree Automata for Syntactic Pattern Recognition
IEEE Transactions on Computers
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Does o-substitution preserve recognizability?
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
| Hi-index | 0.00 |
Although the multidimensional primitives are more powerful than string primitives and there also exist some works concerning distance measure between multidimensional objects, there are no many applications of this kind of languages to syntactic pattern recognition tasks. In this work, multidimensional primitives are used for object modelling in a handwritten digit recognition task under a syntactic approach. Two well-known tree language inference algorithms are considered to build the models, using as error model an algorithm obtaining the editing distance between a tree automaton and a tree; the editing distance algorithm gives the measure needed to complete the classification. The experiments carried out show the good performance of the approach.