Playing a toy-grammar with GCS

Lecture Notes in Computer Science

Volumn 3562, Issue PART II, 2005, Pages 300-309

  Unold, Olgierd ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

CHOMSKY NORMAL FORM (CNF); GRAMMER-BASED CLASSIFIER SYSTEMS (GCS); TOY-GRAMMARS;

LEARNING SYSTEMS;

EID: 26444447031     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499305_31     Document Type: Conference Paper

References (29)

1. Arabas, J.: Wyklady z algorytmow ewolucyjnych. WNT, Warszawa (2001) (in Polish)
2. Angluin, D.: Queries and concept learning. Machine Learning 2(4) (1988) 319-342
3. Aycinena, M., Kochenderfer, M.J., Mulford D.C.: An evolutionary approach to natural language grammar induction. Final project for GS224N: Natural Language Processing. Stanford University (2003)
4. Bianchi, D.: Learning Grammatical Rules from Examples Using a Credit Assignement Algorithm. In: Proc. of The First Online Workshop on Soft Computing (WSC1), Nagoya (1996) 113-118
5. Cichosz, P.: Systemy uczace sie. WNT, Warszawa (2000) (in Polish)
6. Cyre, W.R.: Learning Grammars with a Modified Classifier System. In: Proc. 2002 World Congress on Computational Intelligence, Honolulu Hawaii (2002) 1366-1371
7. Dupont, P.: Regular Grammatical Inference from Positive and Negative Samples by Genetic Search. In: Grammatical Inference and Application, Second International Colloquium ICG-94, Berlin, Springer (1994) 236-245
8. Gold, E.: Language identification in the limit. Information Control 10 (1967) 447-474
9. de la Higuera, C.: Current trends in grammatical inference. In: Ferri, F.J. at al (eds.): Advances in Pattern Recognition. Joint IAPR International Workshops SSPR+SPR'2000, LNCS 1876, Springer (2000) 28-31
10. Holland, J.: Adaptation. In: Rosen, R., Snell, F.M. (eds.): Progress in theoretical biology. New York, Plenum (1976)
11. Holland, J.: Escaping Brittleness: The possibilities of General-Purpose Learning Algorithms Applied to Parallel Rule-Based Systems. In: Michalski, R.S. at al. (eds.): Machine Learning, an artificial intelligence approach. vol. II. Morgan Kaufmann (1986) 593-623
12. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company. Reading Massachusetts (1979)
13. Huijsen, W.: Genetic Grammatical Inference: Induction of Pushdown Automata and Context-Free Grammars from Examples Using Genetic Algorithms. M.Sc.-thesis, Dept. of Computer Science, University of Twente, Enschede, The Netherlands (1993)
14. Kammeyer, T.E., Belew, R.K.: Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search. Technical Report CS96-476, Cognitive Computer Science Research Group, Computer Science and Engineering Department, University of California at San Diego (1996)
15. Keller, B., Lutz, R.: Learning Stochastic Context-Free Grammars from Corpora Using a Genetic Algorithm. In: Proceedings International Conference on Artificial Neural Networks and Genetic Algorithms ICANNGA-97 (1997)
16. Korkmaz, E.E., Ucoluk, G.: Genetic Programming for Grammar Induction. In: Proc. of the Genetic and Evolutionary Conference GECCO-2001, San Francisco Ca, Morgan Kaufmann Publishers (2001)
17. Lankhorst, M.M.: A Genetic Algorithm for the Induction of Nondeterministic Pushdown Automata. Computing Science Reports CS-R 9502, Department of Computing Science, University of Groningen (1995)
18. Lanzi, P.L., Riolo, R.L.: A Roadmap to the Last Decade of Learning Classifier System Research. In: Lanzi, P.L., Stolzmann, W., Wilson, S.W. (eds.): Learning Classifier Systems. From Foundations to Applications, LNAI 1813, Springer Verlag, Berlin (2000) 33-62
19. Lee, L.: Learning of Context-Free Languages: A Survey of the Literature. Report TR-12-96. Harvard University, Cambridge, Massachusetts (1996)
20. Losee, R.M.: Learning Syntactic Rules and Tags with Genetic Algorithms for Information Retrieval and Filtering: An Empirical Basis for Grammatical Rules. In: Information Processing & Management (1995)
21. Lucas, S.: Context-Free Grammar Evolution. In: First International Conference on Evolutionary Computing (1994) 130-135
22. Mhlenbein, H., Schlierkamp-Voosen, D.: Analysis of Selection, Mutation and Recombination in Genetic Algorthms. In: Banzhaf, W., Eeckman, F.H. (eds.): Evolution as a Computational Process, LNCS 899, Springer, Berlin (1995) 188-214
23. Smith, T.C., Witten, I.H.: Learning Language Using Genetic Algorithms. In: Wermter, S., Rilo, E., Scheler, G. (eds.): Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing, LNAI 1040 (1996)
24. Unold, O.: Context-free grammar induction using evolutionary methods, WSEAS Trans. on Circuits and Systems, 3 (2) (2003) 632-637
25. Unold, O., Cielecki, L.: Grammar-based Classifier System. In: Kacprzyk, J., Koronacki, J. (eds.) First Warsaw International Seminar on Intelligent Systems. EXIT Publishing House, Warsaw (2004) (in print).
26. Wilson, S.W.: Classifier Fitness Based on Accuracy. Evolutionary Computation 3 (2) (1995) 147-175
27. Wyard, P.: Context Free Grammar Induction Using Genetic Algorithms. In: Belew, R.K., Booker, L.B. (eds.): Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA. Morgan Kaufmann (1991) 514-518
28. Zhou, H., Grefenstette, J.J.: Induction of Finite Automata by Genetic Algorithms. In: Proceedings of the 1986 International Conference on Systems, Man and Cybernetics (1986) 170-174
29. Younger, D.: Recognition and parsing of context-free languages in time n3. University of Hawaii Technical Report, Department of Computer Science (1967)