[cond-mat/0108530] Language Trees and Zipping

In this letter we present a very general method to extract information from a generic string of characters, e.g. a text, a DNA sequence or a time series. Based on data-compression techniques, its key point is the computation of a suitable measure of the remoteness of two bodies of knowledge. We present the implementation of the method to linguistic motivated problems, featuring highly accurate results for language recognition, authorship attribution and language classification.

[cond-mat/0108530] Language Trees and Zipping Skip to main content arXiv is now an independent nonprofit! Learn more × Search arXiv Press Enter to search · Advanced search --> Condensed Matter > Statistical Mechanics arXiv:cond-mat/0108530 (cond-mat) [Submitted on 31 Aug 2001 ( v1 ), last revised 19 Dec 2001 (this version, v2)] Title: Language Trees and Zipping Authors: Dario Benedetto , Emanuele Caglioti , Vittorio Loreto View a PDF of the paper titled Language Trees and Zipping, by Dario Benedetto and 1 other authors View PDF Abstract: In this letter we present a very general me

saved by

• Ruozhen Gong
• C LI

related reading

• [2309.10668] Language Modeling Is Compressionarxiv.org
• Compression and Intelligencegreene.sh
• Can gzip be a language model?nathan.rs
• arxiv.org/pdf/2505.24832arxiv.org
• [2602.15029] Symmetry in language statistics shapes the geometry of model representationsarxiv.org
• LLMs can invent their own compression - Rajan Agarwalrajan.sh
• arxiv.org/pdf/2512.24880#page=3.56arxiv.org
• 2409.02908arxiv.org
• [2308.07633] A Survey on Model Compression for Large Language Modelsarxiv.org
• [2605.12715] Scaling Laws for Mixture Pretraining Under Data Constraintsarxiv.org
• Esoteric Language Modelsarxiv.org
• [2605.22821] Tokenisation via Convex Relaxationsarxiv.org