Melvin's digital garden

Grammar based compression of reptitive text

Presented at AAAC 2011

LCA (grammar based compression)

Build a grammar tree bottom up, need to store dictionary and text in memory.

Online version do not need external memory, but uses slightly more internal memory.

Read text from left to right and use a queue.

Links to this note