主催: 人工知能学会
会議名: 第95回 人工知能基本問題研究会
回次: 95
開催地: 大阪大学産業科学研究所 管理棟1F講堂
開催日: 2014/10/10
p. 06-
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 Richard M.Karp et al [6], we quickly update frequency in constant space. We experiment this algorithm for several texts and achieve faster grammar compression than [2].