English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30177
Title: Learning of context-sensitive languages described by augmented regular expressions
Authors: Alquézar Mancho, Renato; Sanfeliu, Alberto
Keywords: Pattern recognition
Pattern recognition systems
Issue Date: 1996
Publisher: Institute of Electrical and Electronics Engineers
Citation: 13th International Conference on Pattern Recognition: 745-749 (1996)
Abstract: Recently augmented regular expressions (AREs) have been proposed as a formalism to describe and recognize a non-trivial class of context-sensitive languages (CSLs). AREs augment the expressive power of regular expressions (REs) by including a set of constraints, that involve the number of instances in a string of the operands of the star operations of an RE. Although it has been demonstrated that not all the CSLs can be described by AREs, the class of representable objects includes planar shapes with symmetries, which is important for pattern recognition tasks. In this paper a general method to infer AREs from string examples is presented. The method consists of a regular grammatical inference step, aimed at obtaining a regular superset of the target language, followed by a constraint induction process, which reduces the extension of the inferred language attempting to discover the maximal number of context relations. Hence, this approach avoids the difficulty of learning context-sensitive grammars.
Description: International Conference on Pattern Recognition (ICPR), 1996, Viena (Austria)
URI: http://hdl.handle.net/10261/30177
DOI: http://dx.doi.org/10.1109/ICPR.1996.547663
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf529,78 kBAdobe PDFThumbnail
Show full item record

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.