乱択アルゴリズムを用いた頻出文字列の近似数え上げに基づく省スペース文法圧縮

抄録

We propose a faster online grammar compression based on frequent information in constant space. The online grammar compression based on frequent information[2] is slow due to the cost of dynamic updating of frequency table. Using the fast updatable counting frequency algorithm proposed by Ogata et al [4], we quickly update frequency in constant space. We experiment this algorithm for several texts and achieve faster grammar compression than [2].