Improved TBL algorithm for learning context-free grammar

@inproceedings{Jaworski2007ImprovedTA,
  title={Improved TBL algorithm for learning context-free grammar},
  author={Marcin Jaworski and Olgierd Unold},
  year={2007}
}
In this paper we introduce some improvements to the tabular representation algorithm (TBL) dedicated to inference of grammars in Chomsky normal form. TBL algorithm uses a Genetic Algorithm (GA) to solve partitioning problem, and improvements described here focus on this element of TBL. Improvements involve: i nitial population block size manipulation, block delete specialized operator and modified fitness function. The improved TBL algorithm was experimentally proved to be not so much… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Context - free grammar induction with grammar - based classifier system

  • O. Unold
  • Theoretical Aspects of Syntactic Pattern…
  • 1995

An efficient recognition and syntax-analysis algorithm for context-free languages, Sci

  • T. Kasami
  • Rep. AFCRL-65-558,
  • 1965
1 Excerpt

Similar Papers

Loading similar papers…