Masaya Nakahara

Learn More
Grammar-based compression is a well-studied technique for constructing a small context-free grammar (CFG) uniquely deriving a given text. In this paper, we present an online algorithm for lightweight grammar-based compression. Our algorithm is based on the LCA algorithm [Sakamoto et al. 2004]which guarantees nearly optimum compression ratio and space. LCA,(More)
Practical data structures for the edit-sensitive parsing (ESP) are proposed. Given a string $S$ , its ESP tree is equivalent to a context-free grammar $G$ generating just $S$ , which is represented by a DAG. Using the succinct data structures for trees and permutations, $G$ is decomposed to two LOUDS bit strings and single array in $(1+\epsilon)n\log(More)
  • 1