Representational Issues for Context Free Grammar Induction Using Genetic Algorithms

作者: Peter Wyard

DOI: 10.1007/3-540-58473-0_151

关键词: Affix grammarGrammar systems theoryAdaptive grammarLink grammarExtended Affix GrammarNatural language processingGenerative grammarArtificial intelligenceMildly context-sensitive grammar formalismContext-free grammarComputer science

摘要: This paper describes results on the inference of two classes context free grammar (CFG), using a genetic algorithm (GA). The first class is that n-symbol palindromes, where n=2 to 4; second small natural language grammars. use different normal forms grammars was compared experimentally. encodings in chromosomes GA, and implications these representations within search are discussed. It concluded by paying attention representational issues, worthwhile may be achieved GA.

参考文章(16)
P. Wyard, Context free grammar induction using genetic algorithms Grammatical Inference: Theory, Applications and Alternatives, IEE Colloquium on. ,(1993)
F. Gruau, Cellular encoding as a graph grammar Grammatical Inference: Theory, Applications and Alternatives, IEE Colloquium on. ,(1993)
Avron Barr, Edward A Feigenbaum, Paul R Cohen, The Handbook of Artificial Intelligence ,(1981)
K. Lari, S.J. Young, Applications of stochastic context-free grammars using the Inside-Outside algorithm Computer Speech & Language. ,vol. 5, pp. 237- 257 ,(1991) , 10.1016/0885-2308(91)90009-F
Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman, Rotwani, Introduction to Automata Theory, Languages, and Computation ,(1979)
E Mark Gold, Complexity of automaton identification from given data Information & Computation. ,vol. 37, pp. 302- 320 ,(1978) , 10.1016/S0019-9958(78)90562-4
Dana Angluin, Carl H. Smith, Inductive Inference: Theory and Methods ACM Computing Surveys. ,vol. 15, pp. 237- 269 ,(1983) , 10.1145/356914.356918
B.D. Dunay, F.E. Petry, B.P. Buckles, Regular language induction with genetic programming world congress on computational intelligence. pp. 396- 400 ,(1994) , 10.1109/ICEC.1994.349918