Grammar compression is one of practical compression models based on CFG that is restricted to derives a single string deterministically. To minimize the CFG, the task of grammar compression is closely related to finding and removing duplicated patterns in the input string, and thus the process of finding a minimal grammar is simply considered to be the frequent pattern discovery. We demonstrate how to improve one of such algorithms.