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.

[1]  Yasubumi Sakakibara,et al.  Learning context-free grammars from structural data in polynomial time , 1988, COLT '88.

[2]  J. Oncina Inference of recognizable tree sets , 2003 .

[3]  Michael G. Thomason,et al.  Syntactic Pattern Recognition, An Introduction , 1978, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[5]  Michael D. Garris Design and Collection of a Handwriting Sample Image Database , 1992 .

[6]  Damián López,et al.  Error Correcting Analysis for Tree Languages , 2000, Int. J. Pattern Recognit. Artif. Intell..

[7]  Damián López,et al.  Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata , 2000, SSPR/SPR.

[8]  Pedro García Learning k-Testable tree sets from positive data* , 2003 .

[9]  Yasubumi Sakakibara,et al.  Efficient Learning of Context-Free Grammars from Positive Structural Examples , 1992, Inf. Comput..

[10]  Héctor Rulot Segovia Ecgi: un algoritmo de inferencia gramatical mediante corrección de errores , 1992 .

[11]  Enrique Vidal,et al.  Application of the error-correcting grammatical inference algorithm (ECGI) to planar shape recognition , 1993 .

[12]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[13]  Emilio Sanchis Arnal,et al.  Continuous speech understanding based on automatic learning of acoustic and semantic models , 1994, ICSLP.

[14]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[15]  Mikel L. Forcada,et al.  A note on the Nagendraprasad-Wang-Gupta thinning algorithm , 1995, Pattern Recognit. Lett..

[16]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.