Context free grammar induction using genetic algorithms

A genetic algorithm was developed for the purpose of inferring context free grammars. Results are reported on the inference of two grammars in this class. Various forms of the grammar to generate the language of correctly balanced and nested brackets were successfully inferred, but more complex grammars were not learnt with the resources available. The author also discusses various issues such as the representation of the grammars, the method of evaluation of the chromosomes and means of maintaining diversity in the population which will be important in future efforts to extend this work.<
>