Learning Context-Free Grammars from Partially Structured Examples: Juxtaposition of GCS with TBL

This paper juxtaposes performance of the grammar- based classifier system (GCS) with tabular representation algorithm (TBL) on the task of inducing context-free grammars from partially structured examples. In both cases structured examples rapidly improve the efficiency of learning algorithms, although there are substantial differences in the way they work. GCS requires more attention while setting initial system parameters and structured examples provide a bit more information than in TBL but on the other hand it is more efficient when tested against the same examples' sets.