Language Trees and Zipping

Dario Benedetto, Emanuele Caglioti, and Vittorio Loreto
Phys. Rev. Lett. 88, 048702 – Published 8 January 2002
PDFExport Citation

Abstract

In this Letter we present a very general method for extracting 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.

  • Received 29 August 2001

DOI:https://doi.org/10.1103/PhysRevLett.88.048702

©2002 American Physical Society

Authors & Affiliations

Dario Benedetto1,*, Emanuele Caglioti1,†, and Vittorio Loreto2,3,‡

  • 1“La Sapienza” University, Mathematics Department, Piazzale Aldo Moro 5, 00185 Rome, Italy
  • 2“La Sapienza” University, Physics Department, Piazzale Aldo Moro 5, 00185 Rome, Italy
  • 3INFM, Center for Statistical Mechanics and Complexity, Rome, Italy

  • *Electronic address: benedetto@mat.uniroma1.it
  • Electronic address: caglioti@mat.uniroma1.it
  • Electronic address: loreto@roma1.infn.it

Comments & Replies

Benedetto, Caglioti, and Loreto Reply:

Dario Benedetto, Emanuele Caglioti, and Vittorio Loreto
Phys. Rev. Lett. 90, 089804 (2003)

Comment on “Language Trees and Zipping”

Dmitry V. Khmelev and William J. Teahan
Phys. Rev. Lett. 90, 089803 (2003)

References (Subscription Required)

Click to Expand
Issue

Vol. 88, Iss. 4 — 28 January 2002

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×