Hacker News new | ask | show | jobs
by woliveirajr 27 days ago
Seems a lot like Normalized Compression Distance (https://en.wikipedia.org/wiki/Normalized_compression_distanc...) and Kolmogorov Complexity.
1 comments

Good compression, necessarily, requires good "next token" probability estimation. I was essentially using zlib's implicit probability estimator.