CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Sequential Structuring Element for CFG Induction Using Genetic Algorithm

by N. S. Choubey,M. U. Kharat
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 1
Year of Publication: 2010
Authors: N. S. Choubey,M. U. Kharat
10.5120/29-137

N. S. Choubey,M. U. Kharat . Sequential Structuring Element for CFG Induction Using Genetic Algorithm. International Journal of Computer Applications. 1, 1 ( February 2010), 7-11. DOI=10.5120/29-137

@article{ 10.5120/29-137,
author = { N. S. Choubey,M. U. Kharat },
title = { Sequential Structuring Element for CFG Induction Using Genetic Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 1 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 7-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number1/29-137/ },
doi = { 10.5120/29-137 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:43:32.280090+05:30
%A N. S. Choubey,M. U. Kharat
%T Sequential Structuring Element for CFG Induction Using Genetic Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 1
%P 7-11
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper investigates the induction of Context free Grammar with genetic algorithm. The genetic algorithm is not very effective at this [1]. To overcome this problem we investigate combined effect of two methods for structuring the chromosomes. The first is to bias the distribution of Non-terminals in the chromosome at the time of chromosome generation as well as updating. The latter approach is sequential structural mapping from chromosome to grammar. It is shown that biasing the chromosome in this fashion produces extremely fast convergence as shown in the result section. Grammars are an extremely general and useful tool with many applications. These include the higher levels of signal processing, such as pattern recognition. However, the application of grammars is limited by the algorithms we can apply to infer them from samples of data. The main contribution of this paper is the effective decoding of the context free grammar from chromosomes with the distinct approaches mentioned.

References
  1. Simon Lucas, IEEE, 2000, A. Structuring Chromosomes for Context-Free Grammar Evolution
  2. Wyard P.,1994, Representational Issues for Context-Free Grammar Induction Using Genetic Algorithm in Proceedings of the 2nd International Colloquim on Grammatical Inference and Applications, Lecture Notes in Artificial Intelligence, Vol 862, pp. 222-235,
  3. De la Higuera, 2005, “A Bibliographical Study of Grammatical Inference”, Pattern Recognition, v. 38, no. 9, 2005, pp. 1332-1348.
  4. Ernesto Rodrigues and Heitor Silvério Lopes, Genetic Programming with Incremental Learning for Grammatical Inference, Graduate Program in Electrical Engineering and Computer Science, Federal University of Technology – Paraná, Av. 7 de setembro, 3165 80230-901, Curitiba, Brazil.
  5. Guy De Pauw, 2003, Evolutionary Computing as a Tool for Grammar Development, CNTS – Language Technology Group, UIA – University of Antwerp, Antwerp – Belgium, E. Cant´u-Paz et al. (Eds.): GECCO 2003, LNCS 2723, pp. 549–560, 2003.,c_Springer-Verlag Berlin Heidelberg 2003.
  6. Marcus, M.P., Santorini, B., Marcinkiewicz, M., 1994, Building a large annotated corpus of english: the penn treebank. Computational linguistics 19 (1993) 313–330 Reprinted in Susan Armstrong, ed., Using large corpora, Cambridge, MA: MIT Press, 273–290.
  7. Daelemans,W., van den Bosch, A., Zavrel J, 1999, Forgetting exceptions is harmful in language learning. Machine Learning, Special issue on Natural Language Learning 34 (1999) 11–41.
  8. F. Javed, B. R. Bryant, M.Crepinek, Mernik, Sprague,2004, “Context-free Grammar Induction using GeneticProgramming”, ACMSE, Huntzville.
  9. Marc Lankhorst, “A Genetic Algorithm for the Induction of Nondeterministic Pushdown Automata”, University of Groningen, The Netherlands, May 1995.
Index Terms

Computer Science
Information Sciences

Keywords

Genetic Algorithm Grammar Induction Pattern Recognition Context Free Grammar

Powered by PhDFocusTM