Evidence map›Paper›PMID 34914766›Full record

ArticlePloS one2021

Zipf's laws of meaning in Catalan.

Neus Català, Jaume Baixeries, Ramon Ferrer-I-Cancho, Lluís Padró, Antoni Hernández-Fernández

Abstract read
In one paragraph

Article in PloS one, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing 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

1 citing paper in PubMed.

  1. 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

5 authors.

Neus CatalàTALP Research Center, Computer Science Departament, Universitat Politècnica de Catalunya, Barcelona, Catalonia, Spain.
Jaume BaixeriesLARCA Research Group, Complexity and Quantitative Linguistics Laboratory, Computer Science Departament, Universitat Politècnica de Catalunya, Barcelona, Catalonia, Spain.ORCID 0000-0003-2896-2247
Ramon Ferrer-I-CanchoLARCA Research Group, Complexity and Quantitative Linguistics Laboratory, Computer Science Departament, Universitat Politècnica de Catalunya, Barcelona, Catalonia, Spain.
Lluís PadróTALP Research Center, Computer Science Departament, Universitat Politècnica de Catalunya, Barcelona, Catalonia, Spain.
Antoni Hernández-FernándezLARCA Research Group, Complexity and Quantitative Linguistics Laboratory, Computer Science Departament, Universitat Politècnica de Catalunya, Barcelona, Catalonia, Spain.ORCID 0000-0002-9466-2704

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In his pioneering research, G. K. Zipf formulated a couple of statistical laws on the relationship between the frequency of a word with its number of meanings: the law of meaning distribution, relating the frequency of a word and its frequency rank, and the meaning-frequency law, relating the frequency of a word with its number of meanings. Although these laws were formulated more than half a century ago, they have been only investigated in a few languages. Here we present the first study of these laws in Catalan. We verify these laws in Catalan via the relationship among their exponents and that of the rank-frequency law. We present a new protocol for the analysis of these Zipfian laws that can be extended to other languages. We report the first evidence of two marked regimes for these laws in written language and speech, paralleling the two regimes in Zipf's rank-frequency law in large multi-author corpora discovered in early 2000s. Finally, the implications of these two regimes will be discussed.

Indexed as

CommunicationLanguageModels, TheoreticalSemanticsSpeechAlgorithmsData MiningHumansLinguisticsSpain

Identifiers

PMID34914766
PMCPMC8675765

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.