What algorithm is most suitable for large text compression? Currently, I am looking for an lossless compression algorithm that is suitable for a large amount of text, that will be further encrypt by AES and use as the payload in steganography.

Based on A Comparative Study Of Text Compression Algorithms, it seems that Arithmetic coding is preferable in Statistical compression techniques, while LZB is recommended for Dictionary compression techniques.

So now I am wondering whether Statistical compression or Dictionary compression is more suitable for large English text compression in terms of compression ratio and ease-to-implement.

I have search through but still barely have an idea of the suitable algorithm. Thank you very much for your time in answering. Have a nice day. :)
The Linux kernel has a huge source code, with about 3.2 million lines of code. Source code is totally text, so this can give you an idea about the level of compression that is possible. The entire source code is distributed as a .tar.xz file. Its size is close to 110 megabytes. This offers great compression. Decompress it and see the difference in file size!