On J. Goodman's comment to "Language Trees and Zipping"
D. Benedetto, E. Caglioti, V. Loreto
Abstract
Motivated by the recent submission to cond-mat archives by J. Goodman (cond-mat/0202383) whose results apparently discredit the approach we have proposed in a recent paper (Phys. Rev. Lett., 88, 048702 (2002), cond-mat/0108530), we report the results of the same experiment performed by Goodman using three different data compression schemes. As a matter of fact the three zippers display the same efficiency Goodman obtained using Naive Bayesian Methods and not, as Goodman claimed, an efficiency three times smaller. We point out the question of the extreme generality of approaches based on data compression techniques and we list a large range of potential applications, including those of interest for the physics community.
Create a lesson
Related papers
Universal Boolean Computation in Negatively Coupled Circle Map Lattices
Priyanka D. Bhoyar, Prashant M. Gade
Developing the Statistical Mechanics of Evolving Assembly Spaces
Anisha K. Yeddanapudi, Abhishek Sharma, Ian Seet et al.
Ergodicity breaking transition beyond qubits
Tanay Pathak, Abhik Kumar Saha
Extended-range percolation on lattices with cubic and non-compact neighborhoods in three dimensions
Zhe Zhang, Yuxuan Fan, Yang Yang et al.
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli