HackerPapers

arXiv:cond-mat/0108530cond-mat.stat-mech

Language Trees and Zipping

Dario Benedetto, Emanuele Caglioti, Vittorio Loreto

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

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.

arXiv comments
5 pages, RevTeX4, 1 eps figure. In press in Phys. Rev. Lett. (January 2002)
Journal reference
DOI
doi:10.1103/PhysRevLett.88.048702
Subjects
cond-mat.stat-mechStatistical Mechanics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Aug 2023 to Aug 2023. Found in 1 HN submission from Aug 2026 to Aug 2026. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Gzip on genes is something I wondered about for a good while (since I read about "language trees and zipping" about 20 years ago[1].) Pleased to hear someone tried it! I was wondering in particular whether anyone looked at "junk" DNA with gzip, etc., as a test of how randomised…

      ttctciyfView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.