Error-correcting tree language inference
A new tree language inference algorithm is proposed in this work. This algorithm extends a string language inference algorithm which is based on error correction (ECGI). The algorithm proposed here uses the substructures which have already been taken into account in a tree automaton, modifying the automaton in order to force it to accept the new structures presented in the identification process. The proposed algorithm allows the use of more powerful representation primitives in pattern recognition tasks than the string primitives. It also takes advantage of the thoroughly tested ECGI features used in speech and planar shape recognition tasks. (C) 2002 Elsevier Science B.V. All rights reserved.
error-correcting analysis tree automata grammatical inference syntactic pattern recognition