Applying prereduction to reduce the time cost of TBL algorithm

Nowadays grammar induction is an intensively investigated area and it is a NP-hard problem. TBL [1] [2] and ITBL [3] [4] algorithm provide a way to generate context-free grammar (CFG) from positive and negative sentences. However these algorithms have huge time cost. This paper suggests a prereduction method which can make these algorithm faster. The proposed method performs grammar reduction in the preprocessing step, before execution of genetic algorithm (GA).