Playing a toy-grammar with GCS

  • Authors:
  • Olgierd Unold

  • Affiliations:
  • Institute of Engineering Cybernetics, Wroclaw University of Technology, Wroclaw, Poland

  • Venue:
  • IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Grammar-based Classifier System (GCS) is a new version of Learning Classifier Systems in which classifiers are represented by context-free grammar in Chomsky Normal Form (CNF). Discovering component of the GCS and fitness function were modified and applied for inferring a toy-grammar, a tiny natural language grammar expressed in CNF. The results obtained proved that proposed rule's fertility improves performance of the GCS considerably.