  We show how to compress string dictionaries using the Lempel-Ziv (LZ78) data
compression algorithm. Our approach is validated experimentally on dictionaries
of up to 1.5 GB of uncompressed text. We achieve compression ratios often
outperforming the existing alternatives, especially on dictionaries containing
many repeated substrings. Our query times remain competitive.
