Grammatical Inference with a Genetic Algorithm

1994 ◽  
pp. 423-430 ◽  
Author(s):  
Marc M. Lankhorst
Keyword(s):  
Genetic Algorithm ◽  
Grammatical Inference

scholarly journals Genetic Algorithm for Grammar Induction and Rules Verification through a PDA Simulator

2017 ◽  
Vol 6 (3) ◽  
pp. 100
Author(s):  
Hari Mohan Pandey
Keyword(s):  
Genetic Algorithm ◽  
First Generation ◽  
Training Data ◽  
Grammatical Inference ◽  
Local Optimum ◽  
Grammar Induction ◽  
Inference System ◽  
Grammar Rules ◽  
Two Phases ◽  
Pushdown Automata

The focus of this paper is towards developing a grammatical inference system uses a genetic algorithm (GA), has a powerful global exploration capability that can exploit the optimum offspring. The implemented system runs in two phases: first, generation of grammar rules and verification and then applies the GA’s operation to optimize the rules. A pushdown automata simulator has been developed, which parse the training data over the grammar’s rules. An inverted mutation with random mask and then ‘XOR’ operator has been applied introduces diversity in the population, helps the GA not to get trapped at local optimum. Taguchi method has been incorporated to tune the parameters makes the proposed approach more robust, statistically sound and quickly convergent. The performance of the proposed system has been compared with: classical GA, random offspring GA and crowding algorithms. Overall, a grammatical inference system has been developed that employs a PDA simulator for verification.

scholarly journals Is Parameters Quantification in Genetic Algorithm Important, How to do it?

2017 ◽  
Vol 6 (3) ◽  
pp. 112
Author(s):  
Hari Mohan Pandey
Keyword(s):  
Genetic Algorithm ◽  
Optimization Technique ◽  
Correct Choice ◽  
Considerable Effect ◽  
Primary Objective ◽  
Grammatical Inference ◽  
Quality Of Results ◽  
Wide Range ◽  
Global Optima

The term “appropriate parameters” signifies the correct choice of values has considerable effect on the performance that directs the search process towards the global optima. The performance typically is measured considering both quality of the results obtained and time requires in finding them. A genetic algorithm is a search and optimization technique, whose performance largely depends on various factors – if not tuned appropriately, difficult to get global optima. This paper describes the applicability of orthogonal array and Taguchi approach in tuning the genetic algorithm parameters. The domain of inquiry is grammatical inference has a wide range of applications. The optimal conditions were obtained corresponding to performance and the quality of results with reduced cost and variability. The primary objective of conducting this study is to identify the appropriate parameter setting by which overall performance and quality of results can be enhanced. In addition, a systematic discussion presented will be helpful for researchers in conducting parameters quantification for other algorithms.

Sign in / Sign up

Export Citation Format

Share Document