Error-correcting tree language inference

Authors:
Damián López;Salvador España
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46071 Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46071 Valencia, Spain
Venue:
Pattern Recognition Letters
Year:
2002

Citing 3
Cited 3

Learning context-free grammars from structural data in polynomial time

Theoretical Computer Science
Efficient learning of context-free grammars from positive structural examples

Information and Computation
A note on the Nagendraprasad-Wang-Gupta thinning algorithm

Pattern Recognition Letters

Learning Tree Languages from Text

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Speech emotion recognition with TGI+.2 classifier

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop
Identifying p rules from membrane structures with an error-correcting approach

WMC'06 Proceedings of the 7th international conference on Membrane Computing

Quantified Score

Hi-index	0.10

Visualization

Abstract

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.