본문 바로가기
  • Home

Inference of Context-Free Grammars using Binary Third-order Recurrent Neural Networks with Genetic Algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2012, 17(3), pp.11-25
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

SOON-HO JUNG 1

1부경대학교

Accredited

ABSTRACT

We present the method to infer Context-Free Grammars by applying genetic algorithm to the Binary Third-order Recurrent Neural Networks(BTRNN). BTRNN is a multiple-layered architecture of recurrent neural networks, each of which is corresponding to an input symbol, and is combined with external stack. All parameters of BTRNN are represented as binary numbers and each state transition is performed with any stack operation simultaneously. We apply Genetic Algorithm to BTRNN chromosomes and obtain the optimal BTRNN inferring context-free grammar of positive and negative input patterns. This proposed method infers BTRNN, which includes the number of its states equal to or less than those of existing methods of Discrete Recurrent Neural Networks, with less examples and less learning trials. Also BTRNN is superior to the recent method of chromosomes representing grammars at recognition time complexity because of performing deterministic state transitions and stack operations at parsing process. If the number of non-terminals is p, the number of terminals q, the length of an input string k, and the max number of BTRNN states m, the parallel processing time is O(k) and the sequential processing time is O(km).

Citation status

* References for papers published after 2023 are currently being built.