Evidence map›Paper›PMID 35892209›Full record

ArticleBiology letters2022

Compression principle and Zipf's Law of brevity in infochemical communication.

Antoni Hernández-Fernández, Iván G Torre

Abstract read
In one paragraph

Article in Biology letters, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Antoni Hernández-FernándezComplexity and Quantitative Linguistics Lab, Institut de Ciències de l'Educació, Universitat Politècnica de Catalunya, Av. Doctor Marañón 44-50, Barcelona 08028, Catalonia, Spain.ORCID 0000-0002-9466-2704
Iván G TorreLanguage and Speech Laboratory, Universidad del País Vasco, Justo Vélez de Elorriaga Kalea, 1, 01006 Vitoria, Spain.ORCID 0000-0003-2380-010X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Compression has been presented as a general principle of animal communication. Zipf's Law of brevity is a manifestation of this postulate and can be generalized as the tendency of more frequent communicative elements to be shorter. Previous works supported this claim, showing evidence of Zipf's Law of brevity in animal acoustical communication and human language. However, a significant part of the communicative effort in biological systems is carried out in other transmission channels, such as those based on infochemicals. To fill this gap, we seek, for the first time, evidence of this principle in infochemical communication by analysing the statistical tendency of more frequent infochemicals to be chemically shorter and lighter. We analyse data from the largest and most comprehensive open-access infochemical database known as Pherobase, recovering Zipf's Law of brevity in interspecific communication (allelochemicals) but not in intraspecific communication (pheromones). Moreover, these results are robust even when addressing different magnitudes of study or mathematical approaches. Therefore, different dynamics from the compression principle would dominate intraspecific chemical communication, defying the universality of Zipf's Law of brevity. To conclude, we discuss the exception found for pheromones in the light of other potential communicative paradigms such as pressures on successful communication or the Handicap principle.

Indexed as

Animal CommunicationLanguageAnimalsDatabases, FactualHumansPheromonesPheromonescommunicationcompressioninfochemicalsinformation theorylanguage

Identifiers

PMID35892209
PMCPMC9326285

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.