<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1d3 20150301//EN" "http://jats.nlm.nih.gov/publishing/1.1d3/JATS-journalpublishing1.dtd">
<article article-type="research-article" dtd-version="1.1d3" xml:lang="en" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="nlm-ta">PLoS ONE</journal-id>
<journal-id journal-id-type="publisher-id">plos</journal-id>
<journal-id journal-id-type="pmc">plosone</journal-id>
<journal-title-group>
<journal-title>PLOS ONE</journal-title>
</journal-title-group>
<issn pub-type="epub">1932-6203</issn>
<publisher>
<publisher-name>Public Library of Science</publisher-name>
<publisher-loc>San Francisco, CA USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">PONE-D-23-08610</article-id>
<article-id pub-id-type="doi">10.1371/journal.pone.0291337</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Research Article</subject>
</subj-group>
<subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Linguistics</subject><subj-group><subject>Semantics</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Biology and life sciences</subject><subj-group><subject>Psychology</subject><subj-group><subject>Behavior</subject><subj-group><subject>Antisocial behavior</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Psychology</subject><subj-group><subject>Behavior</subject><subj-group><subject>Antisocial behavior</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Linguistics</subject><subj-group><subject>Computational linguistics</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Communications</subject><subj-group><subject>Social communication</subject><subj-group><subject>Social media</subject></subj-group></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Network analysis</subject><subj-group><subject>Social networks</subject><subj-group><subject>Social media</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Social networks</subject><subj-group><subject>Social media</subject></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Communications</subject><subj-group><subject>Social communication</subject><subj-group><subject>Social media</subject><subj-group><subject>Twitter</subject></subj-group></subj-group></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Network analysis</subject><subj-group><subject>Social networks</subject><subj-group><subject>Social media</subject><subj-group><subject>Twitter</subject></subj-group></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Social networks</subject><subj-group><subject>Social media</subject><subj-group><subject>Twitter</subject></subj-group></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>People and places</subject><subj-group><subject>Population groupings</subject><subj-group><subject>Ethnicities</subject><subj-group><subject>European people</subject><subj-group><subject>Italian people</subject></subj-group></subj-group></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Computer and information sciences</subject><subj-group><subject>Network analysis</subject><subj-group><subject>Social networks</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Social sciences</subject><subj-group><subject>Sociology</subject><subj-group><subject>Social networks</subject></subj-group></subj-group></subj-group><subj-group subj-group-type="Discipline-v3">
<subject>Physical sciences</subject><subj-group><subject>Mathematics</subject><subj-group><subject>Probability theory</subject><subj-group><subject>Statistical distributions</subject></subj-group></subj-group></subj-group></subj-group></article-categories>
<title-group>
<article-title>Benford’s Law applies to word frequency rank in English, German, French, Spanish, and Italian</article-title>
<alt-title alt-title-type="running-head">Benford’s Law applies to word frequency rank in English, German, French, Spanish, and Italian</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes" xlink:type="simple">
<contrib-id authenticated="true" contrib-id-type="orcid">https://orcid.org/0000-0003-3684-307X</contrib-id>
<name name-style="western">
<surname>Golbeck</surname> <given-names>Jennifer</given-names></name>
<role content-type="http://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role content-type="http://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role content-type="http://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role content-type="http://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role content-type="http://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role content-type="http://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role content-type="http://credit.niso.org/contributor-roles/resources/">Resources</role>
<role content-type="http://credit.niso.org/contributor-roles/software/">Software</role>
<role content-type="http://credit.niso.org/contributor-roles/validation/">Validation</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-original-draft/">Writing – original draft</role>
<role content-type="http://credit.niso.org/contributor-roles/writing-review-editing/">Writing – review &amp; editing</role>
<xref ref-type="aff" rid="aff001"/>
<xref ref-type="corresp" rid="cor001">*</xref>
</contrib>
</contrib-group>
<aff id="aff001">
<addr-line>University of Maryland, College Park, MD, United States of America</addr-line>
</aff>
<contrib-group>
<contrib contrib-type="editor" xlink:type="simple">
<name name-style="western">
<surname>De Benedictis</surname> <given-names>Luca</given-names></name>
<role>Editor</role>
<xref ref-type="aff" rid="edit1"/>
</contrib>
</contrib-group>
<aff id="edit1">
<addr-line>University of Macerata, ITALY</addr-line>
</aff>
<author-notes>
<fn fn-type="conflict" id="coi001">
<p>The authors have declared that no competing interests exist.</p>
</fn>
<corresp id="cor001">* E-mail: <email xlink:type="simple">jgolbeck@umd.edu</email></corresp>
</author-notes>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<pub-date pub-type="epub">
<day>14</day>
<month>9</month>
<year>2023</year>
</pub-date>
<volume>18</volume>
<issue>9</issue>
<elocation-id>e0291337</elocation-id>
<history>
<date date-type="received">
<day>22</day>
<month>3</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>29</day>
<month>8</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Jennifer Golbeck</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="info:doi/10.1371/journal.pone.0291337"/>
<abstract>
<p>Benford’s Law states that, in many real-world data sets, the frequency of numbers’ first digits is predicted by the formula <italic>log</italic>(1 + (1/<italic>d</italic>)). Numbers beginning with a 1 occur roughly 30% of the time, and are six times more common than numbers beginning with a 9. We show that Benford’s Law applies to the the frequency rank of words in English, German, French, Spanish, and Italian. We calculated the frequency rank of words in the Google Ngram Viewer corpora. Then, using the first significant digit of the frequency rank, we found the FSD distribution adhered to the expected Benford’s Law distribution. Over a series of additional corpora from sources ranging from news to books to social media and across the languages studied, we consistently found adherence to Benford’s Law. Furthermore, at the user-level on social media, we found Benford’s Law holds for the vast majority of users’ collected posts and significant deviations from Benford’s Law tends to be a mark of spam bots.</p>
</abstract>
<funding-group>
<funding-statement> The author(s) received no specific funding for this work.</funding-statement>
</funding-group>
<counts>
<fig-count count="0"/>
<table-count count="7"/>
<page-count count="12"/>
</counts>
<custom-meta-group>
<custom-meta id="data-availability">
<meta-name>Data Availability</meta-name>
<meta-value>We used 23 public corpra in this study Google - English <ext-link ext-link-type="uri" xlink:href="http://storage.googleapis.com/books/ngrams/books/datasetsv2.html" xlink:type="simple">http://storage.googleapis.com/books/ngrams/books/datasetsv2.html</ext-link> Version 20120701 Google - German <ext-link ext-link-type="uri" xlink:href="http://storage.googleapis.com/books/ngrams/books/datasetsv2.html" xlink:type="simple">http://storage.googleapis.com/books/ngrams/books/datasetsv2.html</ext-link> Version 20120701 Google - Spanish <ext-link ext-link-type="uri" xlink:href="http://storage.googleapis.com/books/ngrams/books/datasetsv2.html" xlink:type="simple">http://storage.googleapis.com/books/ngrams/books/datasetsv2.html</ext-link> Version 20120701 Big English <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/rtatman/english-word-frequency?resource=download" xlink:type="simple">https://www.kaggle.com/datasets/rtatman/english-word-frequency?resource=download</ext-link> Google - French <ext-link ext-link-type="uri" xlink:href="http://storage.googleapis.com/books/ngrams/books/datasetsv2.html" xlink:type="simple">http://storage.googleapis.com/books/ngrams/books/datasetsv2.html</ext-link> Version 20120701 Google -Italian <ext-link ext-link-type="uri" xlink:href="http://storage.googleapis.com/books/ngrams/books/datasetsv2.html" xlink:type="simple">http://storage.googleapis.com/books/ngrams/books/datasetsv2.html</ext-link> Version 20120701 French Reddit <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/breandan/french-reddit-discussion" xlink:type="simple">https://www.kaggle.com/datasets/breandan/french-reddit-discussion</ext-link> Cresci <ext-link ext-link-type="uri" xlink:href="http://mib.projects.iit.cnr.it" xlink:type="simple">http://mib.projects.iit.cnr.it</ext-link> Twitter abortion <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/mcantoni81/italian-tweets-discussion-on-the-roevswade" xlink:type="simple">https://www.kaggle.com/datasets/mcantoni81/italian-tweets-discussion-on-the-roevswade</ext-link> LELU <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/breandan/french-reddit-discussion" xlink:type="simple">https://www.kaggle.com/datasets/breandan/french-reddit-discussion</ext-link> Spanish Wikipedia <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/rtatman/120-million-word-spanish-corpus" xlink:type="simple">https://www.kaggle.com/datasets/rtatman/120-million-word-spanish-corpus</ext-link> COW <ext-link ext-link-type="uri" xlink:href="https://www.webcorpora.org/opendata/frequencies/" xlink:type="simple">https://www.webcorpora.org/opendata/frequencies/</ext-link> Aranea corpra <ext-link ext-link-type="uri" xlink:href="http://unesco.uniba.sk/aranea_about/" xlink:type="simple">http://unesco.uniba.sk/aranea_about/</ext-link> DeReKo <ext-link ext-link-type="uri" xlink:href="https://www.corpusfinder.ugent.be/corpus/69" xlink:type="simple">https://www.corpusfinder.ugent.be/corpus/69</ext-link> BNC <ext-link ext-link-type="uri" xlink:href="http://www.kilgarriff.co.uk/bnc-readme.html" xlink:type="simple">http://www.kilgarriff.co.uk/bnc-readme.html</ext-link> parler <ext-link ext-link-type="uri" xlink:href="https://zenodo.org/record/4442460" xlink:type="simple">https://zenodo.org/record/4442460</ext-link>.</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec id="sec001" sec-type="intro">
<title>Introduction</title>
<p>Benford’s Law states that, in many real-world data sets, the frequency of numbers’ first digits is not evenly distributed. The exact frequency <italic>P</italic> predicted for a first significant digit (FSD) <italic>d</italic> is given by this formula:
<disp-formula id="pone.0291337.e001"><alternatives><graphic id="pone.0291337.e001g" mimetype="image" position="anchor" xlink:href="info:doi/10.1371/journal.pone.0291337.e001" xlink:type="simple"/><mml:math display="block" id="M1"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd columnalign="right"><mml:mrow><mml:mi>P</mml:mi> <mml:mrow><mml:mo>(</mml:mo> <mml:mi>d</mml:mi> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>=</mml:mo> <mml:msub><mml:mtext>log</mml:mtext> <mml:mn>10</mml:mn></mml:msub> <mml:mrow><mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>+</mml:mo> <mml:mrow><mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mi>d</mml:mi> <mml:mo>)</mml:mo></mml:mrow> <mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></alternatives></disp-formula></p>
<p>Benford’s Law is most widely used in forensic accounting, where a violation may indicate fraud [<xref ref-type="bibr" rid="pone.0291337.ref001">1</xref>]. Research has also shown that it applies to Covid reporting [<xref ref-type="bibr" rid="pone.0291337.ref002">2</xref>, <xref ref-type="bibr" rid="pone.0291337.ref003">3</xref>], genome data [<xref ref-type="bibr" rid="pone.0291337.ref004">4</xref>], scientific regression coefficients [<xref ref-type="bibr" rid="pone.0291337.ref005">5</xref>], the stock market in some cases [<xref ref-type="bibr" rid="pone.0291337.ref006">6</xref>] but not others [<xref ref-type="bibr" rid="pone.0291337.ref007">7</xref>], and can be used to detect AI-generated images [<xref ref-type="bibr" rid="pone.0291337.ref008">8</xref>]. Generally, if Benford’s Law typically applies to a system, deviations from it can be indicators of “unnatural” activity.</p>
<p>In statistical linguistics, both word frequency (the number of times a word appears in a corpus) and word <italic>frequency rank</italic> (which word is most popular, 2nd most popular, and so on) are common measures. For example, these are the ten most popular words with their frequency rank and overall occurrence in an English corpus:</p>
<list list-type="order">
<list-item>
<p>the (53,097,401,461)</p>
</list-item>
<list-item>
<p>of (30,966,074,232)</p>
</list-item>
<list-item>
<p>and (22,632,024,504)</p>
</list-item>
<list-item>
<p>to (19,347,398,077)</p>
</list-item>
<list-item>
<p>in (16,891,065,263)</p>
</list-item>
<list-item>
<p>a (15,310,087,895)</p>
</list-item>
<list-item>
<p>is (8,384,246,685)</p>
</list-item>
<list-item>
<p>that (8,000,768,228)</p>
</list-item>
<list-item>
<p>for (6,545,282,031)</p>
</list-item>
<list-item>
<p>it (5,740,085,369)</p>
</list-item>
</list>
<p>For this research, we measured frequency and frequency rank using the Google 1-gram datasets for English, German, French, Spanish, and Italian. Described further below, these corpora contain the count of how often every work appears in a large collection of around 8 million books published between 1500 and 2008, (roughly 6% of all books ever published).</p>
<p>Then, we looked at the distribution of frequency rank FSDs within a variety of additional corpora. We found across corpora and languages, these distributions closely followed Benford’s expected distribution and were statistically indistinguishable. Furthermore, the FSD distribution of the frequency rank of words posted by individual users also closely follow Benford’s Law. In two corpora, we show that when a user’s posts deviate from Benford’s Law, it is associated with spam bot behavior. This echoes previous work that shows violations of Benford’s Law in social network connection behavior is also an indicator of bot activity [<xref ref-type="bibr" rid="pone.0291337.ref009">9</xref>].</p>
<p>We discuss how these results lead to the possibility of using Benford’s Law to detect bots and other unusual or unnatural behavior.</p>
</sec>
<sec id="sec002">
<title>Background and related work</title>
<sec id="sec003">
<title>Benford’s Law</title>
<p>Benford’s Law was first detected by astronomer Simon Newcomb and later validated by physicist Frank Benford. Benford studied naturally occurring numbers from many sources: the surface area of rivers, atomic weights, and numbers appearing in Reader’s Digest, and found all followed the same FSD distribution [<xref ref-type="bibr" rid="pone.0291337.ref010">10</xref>].</p>
<p>The formula for the law, <italic>P</italic>(<italic>d</italic>) = log<sub>10</sub>(1 + (1/<italic>d</italic>)), provides a theoretical distribution of expected first digits, shown in <xref ref-type="table" rid="pone.0291337.t001">Table 1</xref>.</p>
<table-wrap id="pone.0291337.t001" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0291337.t001</object-id>
<label>Table 1</label>
<caption>
<title>Frequency of first significant digits (FSD) expected by Benford’s Law.</title>
</caption>
<alternatives>
<graphic id="pone.0291337.t001g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.t001" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<tbody>
<tr>
<td align="left" style="background-color:#D7D7D7"><bold>FSD</bold></td>
<td align="right" style="background-color:#D7D7D7">1</td>
<td align="right" style="background-color:#D7D7D7">2</td>
<td align="right" style="background-color:#D7D7D7">3</td>
<td align="right" style="background-color:#D7D7D7">4</td>
<td align="right" style="background-color:#D7D7D7">5</td>
<td align="right" style="background-color:#D7D7D7">6</td>
<td align="right" style="background-color:#D7D7D7">7</td>
<td align="right" style="background-color:#D7D7D7">8</td>
<td align="right" style="background-color:#D7D7D7">9</td>
</tr>
<tr>
<td align="left"><bold>Frequency</bold></td>
<td align="right">0.301</td>
<td align="right">0.176</td>
<td align="right">0.125</td>
<td align="right">0.097</td>
<td align="right">0.07918</td>
<td align="right">0.067</td>
<td align="right">0.05799</td>
<td align="right">0.051</td>
<td align="right">0.046</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<p>Benford’s Law is frequently applied in financial and accounting applications, specifically to detect fraud [<xref ref-type="bibr" rid="pone.0291337.ref011">11</xref>]. However, Benford’s law is not always present even when researchers may expect it to be based on the form of the data. For example, [<xref ref-type="bibr" rid="pone.0291337.ref007">7</xref>] examined S&amp;P500 daily closing values and found non-conformity with Benford. Thus, it is important to apply and test with Benford using a careful eye.</p>
<p>Benford’s Law often applies to systems that follow a power law distribution [<xref ref-type="bibr" rid="pone.0291337.ref012">12</xref>]. Power laws are commonly found in social network structures [<xref ref-type="bibr" rid="pone.0291337.ref013">13</xref>] social media [<xref ref-type="bibr" rid="pone.0291337.ref014">14</xref>], and online behavior [<xref ref-type="bibr" rid="pone.0291337.ref015">15</xref>]. In our previous studies, we have shown that Benford’s Law applies to friend and follower counts in social media across platforms, both at the platform level and the individual level [<xref ref-type="bibr" rid="pone.0291337.ref016">16</xref>]. We also showed that violations of Benford’s Law in network structure can be used to identify malicious bots [<xref ref-type="bibr" rid="pone.0291337.ref009">9</xref>].</p>
</sec>
<sec id="sec004">
<title>Rank-frequency distribution, Zipf’s Law, and language</title>
<p>The frequency of a word in a corpus is the number of times it occurs. The rank-frequency, or frequency rank, is the rank of a word when the frequencies of all words are sorted from most to least frequent. The most frequent word in a corpus would have a rank of 1. Frequency rank distributions, not just in languages but of most data, tend to follow a power law distribution [<xref ref-type="bibr" rid="pone.0291337.ref017">17</xref>]. Power laws appear frequently in nature and occur when one variable varies as a power of the other.</p>
<p>Zipf’s law is a particular type of power law distribution that states that frequency is inversely proportional to rank. It was originally formulated with respect to linguistic analysis, addressing the frequency of words in a corpus [<xref ref-type="bibr" rid="pone.0291337.ref018">18</xref>]. Researchers have found that word frequency adheres to Zipf’s law [<xref ref-type="bibr" rid="pone.0291337.ref019">19</xref>].</p>
<p>Zipf’s Law and Benford’s Law have some relationship. Studies have shown that in some contexts, Benford’s Law and Zipf’s law both apply, but not all Zipfian distributions follow Benford’s Law [<xref ref-type="bibr" rid="pone.0291337.ref012">12</xref>].</p>
<p>Despite Zipf’s Law originating from the study of language, and a statistical connection between Benford’s Law and Zipf’s law, there is almost no research into Benford’s Law applying to language. One study found that Chinese character and word frequency could be described by Benford’s Law on small-scale texts [<xref ref-type="bibr" rid="pone.0291337.ref020">20</xref>]. However, there are no studies on large corpora, that look at other languages, or that address frequency rank and Benford’s Law.</p>
</sec>
</sec>
<sec id="sec005">
<title>Methods and data</title>
<p>Our foundational question in this research is if Benford’s Law applies to word frequency rank across languages. If Benford’s Law consistently holds across diverse datasets in a given language, it is evidence that we can expect Benford to hold for most (but not necessarily all!) datasets in that language. That, in turn, would indicate that we may be able to use Benford testing to look for “abnormal” behavior which, in turn, could be an initial indicator of fraudulent or manipulated behavior.</p>
<p>The benefit of using frequency rank is that it allows comparison across corpora. The frequency count of the word “that”, for example, will vary in every corpus, but it’s rank should be approximately the same. In this analysis, using frequency rank also allows us to establish a standard frequency rank for the language as a whole, using very large datasets, which we can then use to evaluate the use in each corpus based on the same values. For example, “that” will be ranked 8 in English and considered the 8th most frequent English word in every corpus, rather than re-measuring it within each corpus.</p>
</sec>
<sec id="sec006">
<title>Establishing word frequency rank</title>
<p>The frequency of a given word in a language can never really be measured since, for example, the vast majority of words spoken are never recorded. Even in recorded language, frequency depends on many factors, including time period, context, region, and format (e.g. written or spoken). It must be measured within a corpus, and corpora vary with respect to all of these factors. For this research, we opted to use the largest corpora available to establish a baseline frequency and frequency rank for words.</p>
<p>We used the Google Books Ngram Viewer dataset [<xref ref-type="bibr" rid="pone.0291337.ref021">21</xref>]. These datasets are built from a large collection of around 8 million books published between 1500 and 2008, which account for roughly 6% of all books ever published. The English dataset is the largest, with approximately 1 trillion words. The German, Spanish, and French datasets each have over 100 billion words, and the Italian dataset has over 60 billion. These are orders of magnitude larger than any other available corpora.</p>
<p>Google makes frequency counts available for each word. To calculate frequency and frequency rank, we first removed tokens that were not words (numbers, punctuation) and then sorted by frequency. We assigned each word a frequency rank beginning at 1 for the most popular word (e.g. “the” in the English corpus).</p>
<p>Analyzing one dataset is not enough to make claims about general rules for language use [<xref ref-type="bibr" rid="pone.0291337.ref022">22</xref>]. In this case, if English in one dataset follows a Benford’s Law distribution, that does not necessarily mean we can draw conclusions about language or even English generally. To mitigate these concerns, we followed the guidelines of [<xref ref-type="bibr" rid="pone.0291337.ref021">21</xref>], considering multiple languages and validating our results on different datasets in the target languages.</p>
<p>We applied the same ranking process to the Google datasets for German, French, Spanish, and Italian. We used these frequency ranks for our Benford’s Law analysis of each language. We also used these frequency ranks as a basis for analyzing other corpora in each language to see if the Benford’s distribution was observable in smaller datasets drawn from a variety of sources. These corpora are discussed in the next section.</p>
</sec>
<sec id="sec007">
<title>Additional corpora</title>
<p>To check if Benford’s Law applies to word usage with respect to frequency rank, we tested on a number of additional large corpora across all five languages. These are drawn from news, social media, books, and the web. The number of total words and unique words in each dataset are given in Tables <xref ref-type="table" rid="pone.0291337.t002">2</xref>–<xref ref-type="table" rid="pone.0291337.t006">6</xref>. The purpose of this analysis was to validate results obtained from the Google Ngrams analysis on very diverse corpora. If Benford’s Law applies robustly to language use, it should be observable in many contexts, corpora of many sizes, and from a variety of sources. Thus, the purpose in choosing these was not to select the biggest or most balanced or those from a specific source. Rather, they were chosen to test how well Benford works in a range of contexts and languages.</p>
<table-wrap id="pone.0291337.t002" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0291337.t002</object-id>
<label>Table 2</label>
<caption>
<title>Distribution of FSD of word’s frequency rank based on use in Google Ngram Viewer corpora.</title>
<p>Total word counts are measured in billions (B).</p>
</caption>
<alternatives>
<graphic id="pone.0291337.t002g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.t002" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">FSD</th>
<th align="right">Benford</th>
<th align="right">English</th>
<th align="right">German</th>
<th align="right">Spanish</th>
<th align="right">Italian</th>
<th align="right">French</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">1</td>
<td align="right">0.30</td>
<td align="right">0.32</td>
<td align="right">0.30</td>
<td align="right">0.33</td>
<td align="right">0.32</td>
<td align="right">0.32</td>
</tr>
<tr>
<td align="right">2</td>
<td align="right">0.18</td>
<td align="right">0.18</td>
<td align="right">0.19</td>
<td align="right">0.17</td>
<td align="right">0.18</td>
<td align="right">0.18</td>
</tr>
<tr>
<td align="right">3</td>
<td align="right">0.12</td>
<td align="right">0.13</td>
<td align="right">0.13</td>
<td align="right">0.11</td>
<td align="right">0.12</td>
<td align="right">0.12</td>
</tr>
<tr>
<td align="right">4</td>
<td align="right">0.10</td>
<td align="right">0.10</td>
<td align="right">0.10</td>
<td align="right">0.09</td>
<td align="right">0.09</td>
<td align="right">0.09</td>
</tr>
<tr>
<td align="right">5</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
<td align="right">0.07</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
</tr>
<tr>
<td align="right">6</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
<td align="right">0.06</td>
<td align="right">0.07</td>
<td align="right">0.06</td>
<td align="right">0.07</td>
</tr>
<tr>
<td align="right">7</td>
<td align="right">0.06</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
</tr>
<tr>
<td align="right">8</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right">9</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Total Words</td>
<td align="right">755 B</td>
<td align="right">103 B</td>
<td align="right">107 B</td>
<td align="right">64 B</td>
<td align="right">167 B</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Unique words</td>
<td align="right">4,999,751</td>
<td align="right">4,540,689</td>
<td align="right">2,250,889</td>
<td align="right">1,825,177</td>
<td align="right">2,741,602</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Pearson <italic>ρ</italic></td>
<td align="right">1.000</td>
<td align="right">0.998</td>
<td align="right">0.996</td>
<td align="right">0.999</td>
<td align="right">0.999</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S value</td>
<td align="right">0.222</td>
<td align="right">0.111</td>
<td align="right">0.111</td>
<td align="right">0.111</td>
<td align="right">0.111</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S p-value</td>
<td align="right">0.9895</td>
<td align="right">1</td>
<td align="right">1</td>
<td align="right">1</td>
<td align="right">1</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<table-wrap id="pone.0291337.t003" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0291337.t003</object-id>
<label>Table 3</label>
<caption>
<title>Distribution of FSD of word’s frequency rank based on use in additional English corpora.</title>
</caption>
<alternatives>
<graphic id="pone.0291337.t003g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.t003" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">FSD</th>
<th align="right">Benford</th>
<th align="right">Parler</th>
<th align="right">Cresci</th>
<th align="right">BNC</th>
<th align="right">Leipzig</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">1</td>
<td align="right">0.30</td>
<td align="right">0.30</td>
<td align="right">0.29</td>
<td align="right">0.31</td>
<td align="right">0.31</td>
</tr>
<tr>
<td align="right">2</td>
<td align="right">0.18</td>
<td align="right">0.15</td>
<td align="right">0.17</td>
<td align="right">0.17</td>
<td align="right">0.16</td>
</tr>
<tr>
<td align="right">3</td>
<td align="right">0.12</td>
<td align="right">0.14</td>
<td align="right">0.13</td>
<td align="right">0.13</td>
<td align="right">0.13</td>
</tr>
<tr>
<td align="right">4</td>
<td align="right">0.10</td>
<td align="right">0.11</td>
<td align="right">0.11</td>
<td align="right">0.10</td>
<td align="right">0.10</td>
</tr>
<tr>
<td align="right">5</td>
<td align="right">0.08</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
</tr>
<tr>
<td align="right">6</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
</tr>
<tr>
<td align="right">7</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.07</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right">8</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right">9</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Total Words</td>
<td align="right">1,760,010,838</td>
<td align="right">73,520,025</td>
<td align="right">95,168,106</td>
<td align="right">17,310,077</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Unique words</td>
<td align="right">1,848,342</td>
<td align="right">620,828</td>
<td align="right">927,596</td>
<td align="right">417,396</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Pearson <italic>ρ</italic></td>
<td align="right">0.989</td>
<td align="right">0.993</td>
<td align="right">0.998</td>
<td align="right">0.997</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S Value</td>
<td align="right">0.111</td>
<td align="right">0.222</td>
<td align="right">0.222</td>
<td align="right">0.111</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S p-value</td>
<td align="right">1</td>
<td align="right">0.9895</td>
<td align="right">0.9895</td>
<td align="right">1</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<table-wrap id="pone.0291337.t004" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0291337.t004</object-id>
<label>Table 4</label>
<caption>
<title>Distribution of FSD of word’s frequency rank based on use in additional German corpora.</title>
</caption>
<alternatives>
<graphic id="pone.0291337.t004g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.t004" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">FSD</th>
<th align="right">Benford</th>
<th align="right">DeRoKo</th>
<th align="right">Aranea</th>
<th align="right">COW</th>
<th align="right">Leipzig</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">1</td>
<td align="right">0.30</td>
<td align="right">0.31</td>
<td align="right">0.30</td>
<td align="right">0.30</td>
<td align="right">0.32</td>
</tr>
<tr>
<td align="right">2</td>
<td align="right">0.18</td>
<td align="right">0.19</td>
<td align="right">0.19</td>
<td align="right">0.19</td>
<td align="right">0.18</td>
</tr>
<tr>
<td align="right">3</td>
<td align="right">0.12</td>
<td align="right">0.13</td>
<td align="right">0.14</td>
<td align="right">0.14</td>
<td align="right">0.13</td>
</tr>
<tr>
<td align="right">4</td>
<td align="right">0.10</td>
<td align="right">0.10</td>
<td align="right">0.10</td>
<td align="right">0.10</td>
<td align="right">0.09</td>
</tr>
<tr>
<td align="right">5</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
</tr>
<tr>
<td align="right">6</td>
<td align="right">0.07</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
</tr>
<tr>
<td align="right">7</td>
<td align="right">0.06</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right">8</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
</tr>
<tr>
<td align="right">9</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Total Words</td>
<td align="right">7,301,006,311</td>
<td align="right">100,379,842</td>
<td align="right">11,331,629,659</td>
<td align="right">15,089,080</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Unique words</td>
<td align="right">98,072</td>
<td align="right">483,408</td>
<td align="right">71,092,150</td>
<td align="right">838,937</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Pearson <italic>ρ</italic></td>
<td align="right">0.999</td>
<td align="right">0.997</td>
<td align="right">0.997</td>
<td align="right">0.999</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S Value</td>
<td align="right">0.222</td>
<td align="right">0.222</td>
<td align="right">0.222</td>
<td align="right">0.222</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S p-value</td>
<td align="right">0.9895</td>
<td align="right">0.9895</td>
<td align="right">0.9895</td>
<td align="right">0.9895</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<table-wrap id="pone.0291337.t005" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0291337.t005</object-id>
<label>Table 5</label>
<caption>
<title>Distribution of FSD of word’s frequency rank based on use in additional Spanish corpora.</title>
</caption>
<alternatives>
<graphic id="pone.0291337.t005g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.t005" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">FSD</th>
<th align="right">Benford</th>
<th align="right">COW</th>
<th align="right">Aranea</th>
<th align="right">LELU</th>
<th align="right">Leipzig</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">1</td>
<td align="right">0.30</td>
<td align="right">0.34</td>
<td align="right">0.33</td>
<td align="right">0.36</td>
<td align="right">0.33</td>
</tr>
<tr>
<td align="right">2</td>
<td align="right">0.18</td>
<td align="right">0.16</td>
<td align="right">0.17</td>
<td align="right">0.16</td>
<td align="right">0.17</td>
</tr>
<tr>
<td align="right">3</td>
<td align="right">0.12</td>
<td align="right">0.11</td>
<td align="right">0.11</td>
<td align="right">0.11</td>
<td align="right">0.11</td>
</tr>
<tr>
<td align="right">4</td>
<td align="right">0.10</td>
<td align="right">0.09</td>
<td align="right">0.09</td>
<td align="right">0.09</td>
<td align="right">0.09</td>
</tr>
<tr>
<td align="right">5</td>
<td align="right">0.08</td>
<td align="right">0.09</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
<td align="right">0.08</td>
</tr>
<tr>
<td align="right">6</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
<td align="right">0.07</td>
<td align="right">0.05</td>
<td align="right">0.08</td>
</tr>
<tr>
<td align="right">7</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.05</td>
<td align="right">0.06</td>
</tr>
<tr>
<td align="right">8</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right">9</td>
<td align="right">0.05</td>
<td align="right">0.03</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
<td align="right">0.04</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Total Words</td>
<td align="right">3,163,716,419</td>
<td align="right">97,268,117</td>
<td align="right">75,709,619</td>
<td align="right">19,817,544</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Unique words</td>
<td align="right">8,540,745</td>
<td align="right">272,471</td>
<td align="right">3,800,336</td>
<td align="right">413,687</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Pearson <italic>ρ</italic></td>
<td align="right">0.989</td>
<td align="right">0.995</td>
<td align="right">0.991</td>
<td align="right">0.994</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S Value</td>
<td align="right">0.222</td>
<td align="right">0.222</td>
<td align="right">0.222</td>
<td align="right">0.111</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S p-value</td>
<td align="right">0.9895</td>
<td align="right">0.9895</td>
<td align="right">0.9895</td>
<td align="right">1</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<table-wrap id="pone.0291337.t006" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0291337.t006</object-id>
<label>Table 6</label>
<caption>
<title>Distribution of FSD of word’s frequency rank based on use in additional French corpora.</title>
</caption>
<alternatives>
<graphic id="pone.0291337.t006g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.t006" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">FSD</th>
<th align="right">Benford</th>
<th align="right">Aranea</th>
<th align="right">Reddit</th>
<th align="right">Leipzig</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">1</td>
<td align="right">0.30</td>
<td align="right">0.32</td>
<td align="right">0.34</td>
<td align="right">0.32</td>
</tr>
<tr>
<td align="right">2</td>
<td align="right">0.18</td>
<td align="right">0.18</td>
<td align="right">0.19</td>
<td align="right">0.19</td>
</tr>
<tr>
<td align="right">3</td>
<td align="right">0.12</td>
<td align="right">0.14</td>
<td align="right">0.11</td>
<td align="right">0.13</td>
</tr>
<tr>
<td align="right">4</td>
<td align="right">0.10</td>
<td align="right">0.09</td>
<td align="right">0.11</td>
<td align="right">0.09</td>
</tr>
<tr>
<td align="right">5</td>
<td align="right">0.08</td>
<td align="right">0.07</td>
<td align="right">0.06</td>
<td align="right">0.07</td>
</tr>
<tr>
<td align="right">6</td>
<td align="right">0.07</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
</tr>
<tr>
<td align="right">7</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.05</td>
<td align="right">0.06</td>
</tr>
<tr>
<td align="right">8</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
</tr>
<tr>
<td align="right">9</td>
<td align="right">0.05</td>
<td align="right">0.03</td>
<td align="right">0.03</td>
<td align="right">0.03</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Total Words</td>
<td align="right">104,152,457</td>
<td align="right">66,518,066</td>
<td align="right">19,419,591</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Unique words</td>
<td align="right">261,637</td>
<td align="right">772,033</td>
<td align="right">360,383</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Pearson <italic>ρ</italic></td>
<td align="right">0.997</td>
<td align="right">0.995</td>
<td align="right">0.998</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S Value</td>
<td align="right">0.111</td>
<td align="right">0.222</td>
<td align="right">0.222</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S p-value</td>
<td align="right">1</td>
<td align="right">0.9895</td>
<td align="right">0.9895</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
<p>Many of these corpora contain non-standard words like usernames, hashtags, misspellings, and URLs. They also have “words” which are numbers, codes, punctuation, emoji, etc. We applied a high level filter to remove numbers and punctuation. Other non-standard words that did not appear in the Google datasets were ignored. While this can constitute a significant percentage of the <italic>unique</italic> words in a corpus, it usually reflects a small percentage of the <italic>total</italic> words. For example, in the Parler dataset, there were 1,848,342 unique words but only 690,590 were in the Google corpus. While it may appear that the majority of words were excluded from analysis, these excluded words made up only 0.79% of all the words used on Parler. Most were usernames and hashtags (e.g. jreidusmct, funnyquotes, ycgoiszxsvipw, oyrgdjxfgxsl, xfajndhbbzz, saddayforamerica). Thus, because the removed words are such a small percentage of all words used, their exclusion should have a negligible impact on the Benford’s analysis. (See also [<xref ref-type="bibr" rid="pone.0291337.ref007">7</xref>] for an analogous discussion of the presence of zeroes in financial data).</p>
<list list-type="bullet">
<list-item>
<p>Cresci (English—Social Media)</p>
<p>The Fake Project dataset is a dataset of Twitter bots and genuine accounts [<xref ref-type="bibr" rid="pone.0291337.ref023">23</xref>]. Across four categories of accounts, the dataset contains 6.6 million tweets.</p>
</list-item>
<list-item>
<p>Parler (English—Social Media)</p>
<p>Parler was a Twitter-like microblogging platform that became popular among Trump supporters and conservatives, particularly in 2020. It tagged itself as “Parler: Speak freely and express yourself openly without fear of being deplatformed for your views” and was seen as a haven after far-right figures were suspended from Twitter for violating their Terms of Service. Parler was a major planning platform for the January 6 insurrection in the United States and it was shut down within a few days of the attacks on the Capitol when their service providers broke ties.</p>
<p>We analyzed a dataset of Parler posts that spans August 2018 to January 2021 and was collected and described in [<xref ref-type="bibr" rid="pone.0291337.ref024">24</xref>]. It includes 183 million posts from 4 million users. Most posts are in English, and we only considered the English language posts in our analysis.</p>
</list-item>
<list-item>
<p>British National Corpus (English—wide coverage)</p>
<p>The British National Corpus (BNC) [<xref ref-type="bibr" rid="pone.0291337.ref025">25</xref>] is a large corpus of samples of English, both written and spoken. It is a balanced corpus which is supposed be representative of how English is used. The written samples, which make up around 90% of the corpus, are collected from newspapers, magazines, journals, fiction and non-fiction books, letters, school essays, and other text. The spoken portion also seeks to use a wide ranging sample, including lectures, radio shows, call-in shows and classroom discussions.</p>
<p>We used the unlemmatized frequency list from the BNC provided at [<xref ref-type="bibr" rid="pone.0291337.ref026">26</xref>].</p>
</list-item>
<list-item>
<p>The German Reference Corpus DeRoKo (German—books and newspapers)</p>
<p>The German Reference Corpus or Deutsches Referenzkorpus (DeRoKo) [<xref ref-type="bibr" rid="pone.0291337.ref027">27</xref>] is a large reference corpus of German texts. It is built from fiction, scientific manuscripts, and newspapers. We conducted our analysis using the DeReKo-2014-II-MainArchive-STT.100000.freq list, which contains approximately 7 billion words.</p>
</list-item>
<list-item>
<p>Aranea (German, Spanish, French, Italian—web pages)</p>
<p>The Aranea corpora comprise web pages crawled beginning in 2013 [<xref ref-type="bibr" rid="pone.0291337.ref028">28</xref>–<xref ref-type="bibr" rid="pone.0291337.ref030">30</xref>]. We used the German, Spanish, French, and Italian corpora in our analysis.</p>
</list-item>
<list-item>
<p>Leipzig News Corpus (German, Spanish, French, Italian, English) The Leipzig corpora are collected from newspaper text and released yearly for each language [<xref ref-type="bibr" rid="pone.0291337.ref031">31</xref>, <xref ref-type="bibr" rid="pone.0291337.ref032">32</xref>]. We used the 1 million sentence corpora from 2008 for English, Spanish and German, and the integrated 2005-2008 corpus for French and Italian.</p>
</list-item>
<list-item>
<p>Corpora from the Web—COW (German, Spanish—web pages)</p>
<p>The Corpora from the Web project provides web corpora for multiple European languages, including German and Spanish [<xref ref-type="bibr" rid="pone.0291337.ref033">33</xref>, <xref ref-type="bibr" rid="pone.0291337.ref034">34</xref>].</p>
</list-item>
<list-item>
<p>Twitter Abortion Discussion (Italian—Social Media)</p>
<p>This focused corpus of around 47,000 tweets was collected in June 2022 after the overturn of Roe v Wade. The tweets are in Italian and were selected if they contained “abortion”, “aborto” or “abortire”. We intentionally include this smaller and more focused dataset as a test of whether Benford’s Law applies to word use in specific contexts.</p>
</list-item>
<list-item>
<p>LÉLU French dialog corpus (French—Social Media)</p>
<p>The LÉLU French dialog corpus [<xref ref-type="bibr" rid="pone.0291337.ref035">35</xref>] is a collection of 556,621 comments from French-language subreddits: /r/france, /r/FrancaisCanadien, /r/truefrance, /r/paslegorafi, and /r/rance.</p>
</list-item>
<list-item>
<p>120M Word Corpus (Spanish—Wikipedia)</p>
<p>The 120M word Spanish Wikicorpus [<xref ref-type="bibr" rid="pone.0291337.ref036">36</xref>] is collected from Spanish-language Wikipedia pages.</p>
</list-item>
</list>
</sec>
<sec id="sec008" sec-type="results">
<title>Results</title>
<sec id="sec009">
<title>Benford’s Law applies across corpora</title>
<p>To investigate the presence of Benford’s Law in language, we considered words’ frequency rank, as described above.</p>
<p>We then represented each word by the FSD of its frequency rank. In this case, both “the” (rank 1) and “it” (rank 10) would be represented as a 1, “of” would be 2, etc. We have frequency counts for each word, so we summed the frequencies for all words with each FSD to get the total occurrence of each FSD in the corpus. Dividing this by the total number of words in the corpus produces the frequency of each FSD.</p>
<p>For the Google corpora, we computed these values for each language. The frequency of each FSD is shown in <xref ref-type="table" rid="pone.0291337.t002">Table 2</xref>. We first computed the Pearson correlation between the observed frequency and the frequency expected if Benford’s Law applies. Pearson correlations are a common way to measure how closely a distribution adheres to Benford’s Law [<xref ref-type="bibr" rid="pone.0291337.ref037">37</xref>–<xref ref-type="bibr" rid="pone.0291337.ref039">39</xref>].</p>
<p>As shown in <xref ref-type="table" rid="pone.0291337.t002">Table 2</xref>, all correlations are almost perfect, with the lowest <italic>ρ</italic> = 0.996. All correlations were significant for <italic>p</italic> &lt; 0.001 with a Bonferroni correction of 23 to account for all corpora correlations performed in this study.</p>
<p>We also ran Kolmogorov–Smirnov (K-S) tests to check the fit of the data with the Benford’s Law distribution. The K-S <italic>p</italic>-values, which indicate the probability that the social network’s FSD distribution is the same as Benford’s, are also shown in <xref ref-type="table" rid="pone.0291337.t002">Table 2</xref>. These values are all &gt; 0.98, indicating a near perfect match with the expected distribution.</p>
<p>We performed the same analysis on additional corpora using the frequency ranks from the Google dataset. As with the large Google corpora, the Pearson correlation was strong on every additional corpus. Every value was &gt; 0.96 and all were significant for <italic>p</italic> &lt; 0.001 with the Bonferroni correction described above. Similarly, the K-S tests showed strong adherence to Benford’s Law, with p-values &gt; 0.98. Results for each language are shown in Tables <xref ref-type="table" rid="pone.0291337.t003">3</xref> to <xref ref-type="table" rid="pone.0291337.t007">7</xref>.</p>
<table-wrap id="pone.0291337.t007" position="float">
<object-id pub-id-type="doi">10.1371/journal.pone.0291337.t007</object-id>
<label>Table 7</label>
<caption>
<title>Distribution of FSD of word’s frequency rank based on use in additional Italian corpora.</title>
</caption>
<alternatives>
<graphic id="pone.0291337.t007g" mimetype="image" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.t007" xlink:type="simple"/>
<table border="0" frame="box" rules="all">
<colgroup>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
<col align="left" valign="middle"/>
</colgroup>
<thead>
<tr>
<th align="right">FSD</th>
<th align="right">Benford</th>
<th align="right">Aranea</th>
<th align="right">Twitter—Abortion</th>
<th align="right">Leipzig</th>
</tr>
</thead>
<tbody>
<tr>
<td align="right">1</td>
<td align="right">0.30</td>
<td align="right">0.33</td>
<td align="right">0.35</td>
<td align="right">0.32</td>
</tr>
<tr>
<td align="right">2</td>
<td align="right">0.18</td>
<td align="right">0.17</td>
<td align="right">0.16</td>
<td align="right">0.17</td>
</tr>
<tr>
<td align="right">3</td>
<td align="right">0.12</td>
<td align="right">0.10</td>
<td align="right">0.12</td>
<td align="right">0.11</td>
</tr>
<tr>
<td align="right">4</td>
<td align="right">0.10</td>
<td align="right">0.06</td>
<td align="right">0.09</td>
<td align="right">0.11</td>
</tr>
<tr>
<td align="right">5</td>
<td align="right">0.08</td>
<td align="right">0.09</td>
<td align="right">0.07</td>
<td align="right">0.08</td>
</tr>
<tr>
<td align="right">6</td>
<td align="right">0.07</td>
<td align="right">0.09</td>
<td align="right">0.07</td>
<td align="right">0.06</td>
</tr>
<tr>
<td align="right">7</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
<td align="right">0.06</td>
</tr>
<tr>
<td align="right">8</td>
<td align="right">0.05</td>
<td align="right">0.08</td>
<td align="right">0.04</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right">9</td>
<td align="right">0.05</td>
<td align="right">0.04</td>
<td align="right">0.05</td>
<td align="right">0.05</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Total Words</td>
<td align="right">94,921,972</td>
<td align="right">1,175,775</td>
<td align="right">18,716,950</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Unique words</td>
<td align="right">314,426</td>
<td align="right">55,373</td>
<td align="right">430,832</td>
</tr>
<tr>
<td align="right"/>
<td align="right">Pearson <italic>ρ</italic></td>
<td align="right">0.967</td>
<td align="right">0.989</td>
<td align="right">0.996</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S Value</td>
<td align="right">0.111</td>
<td align="right">0.111</td>
<td align="right">0.222</td>
</tr>
<tr>
<td align="right"/>
<td align="right">K-S p-value</td>
<td align="right">1</td>
<td align="right">1</td>
<td align="right">0.9895</td>
</tr>
</tbody>
</table>
</alternatives>
</table-wrap>
</sec>
<sec id="sec010">
<title>User-level analysis on social media</title>
<p>In previous studies, we showed that Benford’s Law applied to the network structure of social media platforms as a whole and also to individual users’ egocentric networks [<xref ref-type="bibr" rid="pone.0291337.ref016">16</xref>]. When individual users significantly deviated from the expected Benford distribution, it was often an indicator that the accounts were bots. This inspired similar questions for this analysis. Does Benford’s Law hold for the frequency rank of individual users’ word choice and, if so, does deviation from Benford indicate bot-like behavior?</p>
<p>Among the social media corpora considered in this analysis, Parler and Cresci had many tweets per individual user. The French Reddit and Italian Twitter corpora often had only one post per user which was not enough text to conduct this type of analysis.</p>
<p>The Cresci data has an additional benefit in that it is a labeled dataset for analyzing bots. Accounts are labeled as “genuine” or one of several types of bots. We considered genuine accounts, social spam bots, and traditional spam bots.</p>
<p>For each user in these groups, we built a set of their tweets. We excluded any users who had posted fewer than 1,000 words to ensure our statistics would be meaningful. This left us with 1,048 genuine accounts, 2,214 social spam accounts, and 160 traditional spam accounts.</p>
<p>For each user, we measured the distribution of FSDs of the frequency rank of each word they used. We then compared each individual user’s FSD distribution against the expected Benford distribution. As is common practice, we used the Pearson correlation to measure how well the distributions fit.</p>
<p>The mean correlation coefficient for genuine accounts (0.977) was significantly higher than that of social spam bots (0.947) or traditional spam bots (0.908). A one-way ANOVA revealed that there was a statistically significant difference in the Pearson correlation coefficients between at least two groups (<italic>F</italic>(2, 3419) = [281.1596], <italic>p</italic> = 0). Tukey’s HSD Test for multiple comparisons found that the mean correlation coefficient was significantly different between genuine users and social spam bots (<italic>p</italic> =&lt; 0.001, 95%<italic>C</italic>.<italic>I</italic>. = [0.061, 0.078]) and between genuine users and traditional spam bots (<italic>p</italic> =&lt; 0.001, 95%<italic>C</italic>.<italic>I</italic>. = [0.026, 0.033]).</p>
<p>In the Parler dataset, accounts are not labeled as bots or not. As a preliminary investigation, we sorted accounts by their Pearson <italic>ρ</italic> and qualitatively analyzed 100 accounts—the 50 with the strongest correlations and the 50 accounts with the weakest correlations. Based on visual inspection of the content, there did not appear to be any spam bots among the top Benford-correlated Parler users. Among the 50 weakest correlates, inspection of their posts indicated 45 were obvious spam bots and 3 more were bots posting other automated content. Among the obvious spam bots were accounts that posted the same message over and over. These are representative examples of the repeated posts from five different accounts:</p>
<list list-type="bullet">
<list-item>
<p>Welcome! Follow me for conservative Memes and News.</p>
</list-item>
<list-item>
<p>Welcome to Parler, Patriot! Follow me and I will definitely give you a follow back!</p>
</list-item>
<list-item>
<p>Follow me for funny conservative comedy on parler Don’t forget to echo!</p>
</list-item>
<list-item>
<p>Follow me for more Trump tweets! GOD bless all you Patriots!</p>
</list-item>
<list-item>
<p>The White Rabbit welcomes you to Parler. Hope to see you around the <inline-formula id="pone.0291337.e002"><inline-graphic mimetype="image" xlink:href="info:doi/10.1371/journal.pone.0291337.e002" xlink:type="simple"/></inline-formula> hole! Follow the White Rabbit…</p>
</list-item>
</list>
</sec>
</sec>
<sec id="sec011" sec-type="conclusions">
<title>Discussion and conclusions</title>
<p>We have shown that Benford’s Law applies to the frequency rank distribution of words in English, French, German, Spanish, and Italian. Using large datasets from a range of sources, we consistently found a strong correlation and statistical adherence to the expected Benford’s Law distribution. We also showed that Benford’s Law applies to the smaller samples of individuals’ social media posts in the vast majority of cases. However, spam bots tend to have a lower correlation with Benford’s distribution and strong deviations from the expected distribution are indicators of bot activity.</p>
<p>While many bots <italic>do</italic> closely adhere to the FSD distribution predicted by Benford’s Law, analysis for the Cresci bot dataset shows that there is some signal present indicating that a deviation from the expected distribution is tied to bot status. Furthermore, among the biggest deviators in the Parler dataset, almost all were spam bots. While correlation with Benford alone is not strong enough to indicate an account is a bot or not, these results suggest this could be one factor to include in bot detection algorithms to potentially improve their performance.</p>
<p>These results suggest a number of avenues for future work. First, given there is some relationship between data that follows Zipf’s Law and Benford’s Law [<xref ref-type="bibr" rid="pone.0291337.ref012">12</xref>], Benford tests can be expanded further. We have focused on Western European languages and a natural next step would be to verify this in a wider range of languages. Existing work suggests this likely would work, given the word frequency results in Chinese [<xref ref-type="bibr" rid="pone.0291337.ref020">20</xref>]. Zipf’s Law has also been shown to hold in the vocalizations of other species, including dolphins [<xref ref-type="bibr" rid="pone.0291337.ref040">40</xref>] and penguins [<xref ref-type="bibr" rid="pone.0291337.ref041">41</xref>]; does Benford’s Law apply as well? Additionally, Zipf himself posited psychological theories for why his law works. He that the relationship exists to minimize effort both for the speaker and hearer. The speaker wants to use the fewest number of words, while the hearer wants the words with the clearest meaning used [<xref ref-type="bibr" rid="pone.0291337.ref042">42</xref>]. There is an intriguing line of work to connect psychological research on Zipf’s Law and language with Benford’s Law to see if there are insights to be uncovered that can psychologically explain Benfordian behavior.</p>
</sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="pone.0291337.ref001">
<label>1</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Durtschi</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Hillison</surname> <given-names>W</given-names></name>, <name name-style="western"><surname>Pacini</surname> <given-names>C</given-names></name>. <article-title>The effective use of BenfordÕs law to assist in detecting fraud in accounting data</article-title>. <source>Journal of forensic accounting</source>. <year>2004</year>;<volume>5</volume>(<issue>1</issue>):<fpage>17</fpage>–<lpage>34</lpage>.</mixed-citation>
</ref>
<ref id="pone.0291337.ref002">
<label>2</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Koch</surname> <given-names>C</given-names></name>, <name name-style="western"><surname>Okamura</surname> <given-names>K</given-names></name>. <article-title>Benford’s law and COVID-19 reporting</article-title>. <source>Economics letters</source>. <year>2020</year>;<volume>196</volume>:<fpage>109573</fpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.econlet.2020.109573" xlink:type="simple">10.1016/j.econlet.2020.109573</ext-link></comment> <object-id pub-id-type="pmid">32952242</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref003">
<label>3</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Sambridge</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Jackson</surname> <given-names>A</given-names></name>. <article-title>National COVID numbers–Benford’s law looks for errors</article-title>. <source>Nature</source>. <year>2020</year>;<volume>581</volume>(<issue>7809</issue>):<fpage>384</fpage>–<lpage>385</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/d41586-020-01565-5" xlink:type="simple">10.1038/d41586-020-01565-5</ext-link></comment> <object-id pub-id-type="pmid">32457528</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref004">
<label>4</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Hoyle</surname> <given-names>DC</given-names></name>, <name name-style="western"><surname>Rattray</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Jupp</surname> <given-names>R</given-names></name>, <name name-style="western"><surname>Brass</surname> <given-names>A</given-names></name>. <article-title>Making sense of microarray data distributions</article-title>. <source>Bioinformatics</source>. <year>2002</year>;<volume>18</volume>(<issue>4</issue>):<fpage>576</fpage>–<lpage>584</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1093/bioinformatics/18.4.576" xlink:type="simple">10.1093/bioinformatics/18.4.576</ext-link></comment> <object-id pub-id-type="pmid">12016055</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref005">
<label>5</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Diekmann</surname> <given-names>A</given-names></name>. <article-title>Not the First Digit! Using Benford’s Law to Detect Fraudulent Scientif ic Data</article-title>. <source>Journal of Applied Statistics</source>. <year>2007</year>;<volume>34</volume>(<issue>3</issue>):<fpage>321</fpage>–<lpage>329</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/02664760601004940" xlink:type="simple">10.1080/02664760601004940</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref006">
<label>6</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Hill</surname> <given-names>TP</given-names></name>. <article-title>The First Digit Phenomenon A century-old observation about an unexpected pattern in many numerical tables applies to the stock market, census statistics and accounting data</article-title>. <source>American Scientist</source>. <year>1998</year>;<volume>86</volume>(<issue>4</issue>):<fpage>358</fpage>–<lpage>363</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1511/1998.31.358" xlink:type="simple">10.1511/1998.31.358</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref007">
<label>7</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Ausloos</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Ficcadenti</surname> <given-names>V</given-names></name>, <name name-style="western"><surname>Dhesi</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Shakeel</surname> <given-names>M</given-names></name>. <article-title>Benford’s laws tests on S&amp;P500 daily closing values and the corresponding daily log-returns both point to huge non-conformity</article-title>. <source>Physica A: Statistical Mechanics and its Applications</source>. <year>2021</year>;<volume>574</volume>:<fpage>125969</fpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.physa.2021.125969" xlink:type="simple">10.1016/j.physa.2021.125969</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref008">
<label>8</label>
<mixed-citation publication-type="other" xlink:type="simple">Bonettini N, Bestagini P, Milani S, Tubaro S. On the use of Benford’s law to detect GAN-generated images. In: 2020 25th international conference on pattern recognition (ICPR). IEEE; 2021. p. 5495–5502.</mixed-citation>
</ref>
<ref id="pone.0291337.ref009">
<label>9</label>
<mixed-citation publication-type="other" xlink:type="simple">Golbeck J. Benford’s law can detect malicious social bots. First Monday. 2019;.</mixed-citation>
</ref>
<ref id="pone.0291337.ref010">
<label>10</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Benford</surname> <given-names>F</given-names></name>. <article-title>The law of anomalous numbers</article-title>. <source>Proceedings of the American Philosophical Society</source>. <year>1938</year>; p. <fpage>551</fpage>–<lpage>572</lpage>.</mixed-citation>
</ref>
<ref id="pone.0291337.ref011">
<label>11</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Nigrini</surname> <given-names>MJ</given-names></name>. <source>Benford’s Law: Applications for forensic accounting, auditing, and fraud detection</source>. <volume>vol. 586</volume>. <publisher-name>John Wiley &amp; Sons</publisher-name>; <year>2012</year>.</mixed-citation>
</ref>
<ref id="pone.0291337.ref012">
<label>12</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Pietronero</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Tosatti</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Tosatti</surname> <given-names>V</given-names></name>, <name name-style="western"><surname>Vespignani</surname> <given-names>A</given-names></name>. <article-title>Explaining the uneven distribution of numbers in nature: the laws of Benford and Zipf</article-title>. <source>Physica A: Statistical Mechanics and its Applications</source>. <year>2001</year>;<volume>293</volume>(<issue>1</issue>):<fpage>297</fpage>–<lpage>304</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0378-4371(00)00633-6" xlink:type="simple">10.1016/S0378-4371(00)00633-6</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref013">
<label>13</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Barabási</surname> <given-names>AL</given-names></name>, <name name-style="western"><surname>Albert</surname> <given-names>R</given-names></name>. <article-title>Emergence of scaling in random networks</article-title>. <source>science</source>. <year>1999</year>;<volume>286</volume>(<issue>5439</issue>):<fpage>509</fpage>–<lpage>512</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1126/science.286.5439.509" xlink:type="simple">10.1126/science.286.5439.509</ext-link></comment> <object-id pub-id-type="pmid">10521342</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref014">
<label>14</label>
<mixed-citation publication-type="other" xlink:type="simple">Asur S, Huberman BA, Szabo G, Wang C. Trends in social media: Persistence and decay. Available at SSRN 1755748. 2011;.</mixed-citation>
</ref>
<ref id="pone.0291337.ref015">
<label>15</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Giles</surname> <given-names>DE</given-names></name>. <article-title>Benford’s law and naturally occurring prices in certain ebaY auctions</article-title>. <source>Applied Economics Letters</source>. <year>2007</year>;<volume>14</volume>(<issue>3</issue>):<fpage>157</fpage>–<lpage>161</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/13504850500425667" xlink:type="simple">10.1080/13504850500425667</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref016">
<label>16</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Golbeck</surname> <given-names>J</given-names></name>. <article-title>Benford’s law applies to online social networks</article-title>. <source>PloS one</source>. <year>2015</year>;<volume>10</volume>(<issue>8</issue>):<fpage>e0135169</fpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0135169" xlink:type="simple">10.1371/journal.pone.0135169</ext-link></comment> <object-id pub-id-type="pmid">26308716</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref017">
<label>17</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Li</surname> <given-names>W</given-names></name>. <article-title>Random texts exhibit Zipf’s-law-like word frequency distribution</article-title>. <source>IEEE Transactions on information theory</source>. <year>1992</year>;<volume>38</volume>(<issue>6</issue>):<fpage>1842</fpage>–<lpage>1845</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/18.165464" xlink:type="simple">10.1109/18.165464</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref018">
<label>18</label>
<mixed-citation publication-type="book" xlink:type="simple">
<name name-style="western"><surname>Fagan</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Gençay</surname> <given-names>R</given-names></name>. <chapter-title>An introduction to textual econometrics</chapter-title>. <source>Handbook of empirical economics and finance</source>. <year>2010</year>; p. <fpage>133</fpage>–<lpage>153</lpage>.</mixed-citation>
</ref>
<ref id="pone.0291337.ref019">
<label>19</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Piantadosi</surname> <given-names>ST</given-names></name>. <article-title>Zipf’s word frequency law in natural language: A critical review and future directions</article-title>. <source>Psychonomic bulletin &amp; review</source>. <year>2014</year>;<volume>21</volume>:<fpage>1112</fpage>–<lpage>1130</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3758/s13423-014-0585-6" xlink:type="simple">10.3758/s13423-014-0585-6</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref020">
<label>20</label>
<mixed-citation publication-type="other" xlink:type="simple">Gao J, Zhao Y, Cui R. Research on the Applicability of Benford’s Law in Chinese Texts. In: 2020 2nd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM). IEEE; 2020. p. 13–17.</mixed-citation>
</ref>
<ref id="pone.0291337.ref021">
<label>21</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Younes</surname> <given-names>N</given-names></name>, <name name-style="western"><surname>Reips</surname> <given-names>UD</given-names></name>. <article-title>Guideline for improving the reliability of Google Ngram studies: Evidence from religious terms</article-title>. <source>PloS one</source>. <year>2019</year>;<volume>14</volume>(<issue>3</issue>):<fpage>e0213554</fpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0213554" xlink:type="simple">10.1371/journal.pone.0213554</ext-link></comment> <object-id pub-id-type="pmid">30901329</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref022">
<label>22</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Pechenick</surname> <given-names>EA</given-names></name>, <name name-style="western"><surname>Danforth</surname> <given-names>CM</given-names></name>, <name name-style="western"><surname>Dodds</surname> <given-names>PS</given-names></name>. <article-title>Characterizing the Google Books corpus: Strong limits to inferences of socio-cultural and linguistic evolution</article-title>. <source>PloS one</source>. <year>2015</year>;<volume>10</volume>(<issue>10</issue>):<fpage>e0137041</fpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0137041" xlink:type="simple">10.1371/journal.pone.0137041</ext-link></comment> <object-id pub-id-type="pmid">26445406</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref023">
<label>23</label>
<mixed-citation publication-type="other" xlink:type="simple">Cresci S, Di Pietro R, Petrocchi M, Spognardi A, Tesconi M. The paradigm-shift of social spambots: Evidence, theories, and tools for the arms race. In: Proceedings of the 26th international conference on world wide web companion; 2017. p. 963–972.</mixed-citation>
</ref>
<ref id="pone.0291337.ref024">
<label>24</label>
<mixed-citation publication-type="other" xlink:type="simple">Aliapoulios M, Bevensee E, Blackburn J, Bradlyn B, De Cristofaro E, Stringhini G, et al. A large open dataset from the parler social network. In: Proceedings of the International AAAI Conference on Web and Social Media. vol. 15; 2021. p. 943–951.</mixed-citation>
</ref>
<ref id="pone.0291337.ref025">
<label>25</label>
<mixed-citation publication-type="other" xlink:type="simple">Consortium B, et al. British national corpus. Oxford Text Archive Core Collection. 2007;.</mixed-citation>
</ref>
<ref id="pone.0291337.ref026">
<label>26</label>
<mixed-citation publication-type="other" xlink:type="simple">Kilgarriff A. BNC database and word frequency lists;. Available from: <ext-link ext-link-type="uri" xlink:href="http://www.kilgarriff.co.uk/bnc-readme.html" xlink:type="simple">http://www.kilgarriff.co.uk/bnc-readme.html</ext-link>.</mixed-citation>
</ref>
<ref id="pone.0291337.ref027">
<label>27</label>
<mixed-citation publication-type="other" xlink:type="simple">Kupietz M, Belica C, Keibel H, Witt A. The German Reference Corpus DeReKo: A Primordial Sample for Linguistic Research. In: Proceedings of the Seventh International Conference on Language Resources and Evaluation (LREC’10); 2010.</mixed-citation>
</ref>
<ref id="pone.0291337.ref028">
<label>28</label>
<mixed-citation publication-type="other" xlink:type="simple">Benko V. Aranea: Yet another family of (comparable) web corpora. In: Text, Speech and Dialogue: 17th International Conference, TSD 2014, Brno, Czech Republic, September 8-12, 2014. Proceedings 17. Springer; 2014. p. 247–256.</mixed-citation>
</ref>
<ref id="pone.0291337.ref029">
<label>29</label>
<mixed-citation publication-type="other" xlink:type="simple">Benko V. Compatible sketch grammars for comparable corpora. In: Proceedings of the XVI EURALEX International Congress: The User In Focus; 2014. p. 15–19.</mixed-citation>
</ref>
<ref id="pone.0291337.ref030">
<label>30</label>
<mixed-citation publication-type="other" xlink:type="simple">Rychlỳ P. Manatee/Bonito-A Modular Corpus Manager. In: RASLAN; 2007. p. 65–70.</mixed-citation>
</ref>
<ref id="pone.0291337.ref031">
<label>31</label>
<mixed-citation publication-type="other" xlink:type="simple">Biemann C, Heyer G, Quasthoff U, Richter M. The Leipzig corpora collection-monolingual corpora of standard size. Proceedings of Corpus Linguistic. 2007;2007.</mixed-citation>
</ref>
<ref id="pone.0291337.ref032">
<label>32</label>
<mixed-citation publication-type="other" xlink:type="simple">Collection LC. News corpus based on material from 2022;. <ext-link ext-link-type="uri" xlink:href="https://corpora.uni-leipzig.de" xlink:type="simple">https://corpora.uni-leipzig.de</ext-link>.</mixed-citation>
</ref>
<ref id="pone.0291337.ref033">
<label>33</label>
<mixed-citation publication-type="other" xlink:type="simple">Schäfer R, Bildhauer F. Building large corpora from the web using a new efficient tool chain. In: Lrec; 2012. p. 486–493.</mixed-citation>
</ref>
<ref id="pone.0291337.ref034">
<label>34</label>
<mixed-citation publication-type="other" xlink:type="simple">Schäfer R. Processing and querying large web corpora with the COW14 architecture. In: Proceedings of the 3rd Workshop on Challenges in the Management of Large Corpora; 2015. p. 28–34.</mixed-citation>
</ref>
<ref id="pone.0291337.ref035">
<label>35</label>
<mixed-citation publication-type="other" xlink:type="simple">El Bawab A, Considine B, Saleh Z. LELU: A French Dialogue Corpus from Reddit; 2017.</mixed-citation>
</ref>
<ref id="pone.0291337.ref036">
<label>36</label>
<mixed-citation publication-type="other" xlink:type="simple">Reese S, Boleda G, Cuadros M, Padró L, Rigau G. Wikicorpus: A word-sense disambiguated multilingual wikipedia corpus. In: Proceedings of the Seventh International Conference on Language Resources and Evaluation (LREC’10); 2010.</mixed-citation>
</ref>
<ref id="pone.0291337.ref037">
<label>37</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Judge</surname> <given-names>G</given-names></name>, <name name-style="western"><surname>Schechter</surname> <given-names>L</given-names></name>. <article-title>Detecting problems in survey data using BenfordÕs Law</article-title>. <source>Journal of Human Resources</source>. <year>2009</year>;<volume>44</volume>(<issue>1</issue>):<fpage>1</fpage>–<lpage>24</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3368/jhr.44.1.1" xlink:type="simple">10.3368/jhr.44.1.1</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref038">
<label>38</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Bhattacharya</surname> <given-names>S</given-names></name>, <name name-style="western"><surname>Xu</surname> <given-names>D</given-names></name>, <name name-style="western"><surname>Kumar</surname> <given-names>K</given-names></name>. <article-title>An ANN-based auditor decision support system using Benford’s law</article-title>. <source>Decision support systems</source>. <year>2011</year>;<volume>50</volume>(<issue>3</issue>):<fpage>576</fpage>–<lpage>584</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.dss.2010.08.011" xlink:type="simple">10.1016/j.dss.2010.08.011</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref039">
<label>39</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Jolion</surname> <given-names>JM</given-names></name>. <article-title>Images and Benford’s law</article-title>. <source>Journal of Mathematical Imaging and Vision</source>. <year>2001</year>;<volume>14</volume>(<issue>1</issue>):<fpage>73</fpage>–<lpage>81</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/A:1008363415314" xlink:type="simple">10.1023/A:1008363415314</ext-link></comment></mixed-citation>
</ref>
<ref id="pone.0291337.ref040">
<label>40</label>
<mixed-citation publication-type="other" xlink:type="simple">Vradi AA. Dolphin communication: a quantitative linguistics approach. Universitat Politècnica de Catalunya; 2021.</mixed-citation>
</ref>
<ref id="pone.0291337.ref041">
<label>41</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Favaro</surname> <given-names>L</given-names></name>, <name name-style="western"><surname>Gamba</surname> <given-names>M</given-names></name>, <name name-style="western"><surname>Cresta</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Fumagalli</surname> <given-names>E</given-names></name>, <name name-style="western"><surname>Bandoli</surname> <given-names>F</given-names></name>, <name name-style="western"><surname>Pilenga</surname> <given-names>C</given-names></name>, <etal>et al</etal>. <article-title>Do penguins’ vocal sequences conform to linguistic laws?</article-title> <source>Biology letters</source>. <year>2020</year>;<volume>16</volume>(<issue>2</issue>):<fpage>20190589</fpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1098/rsbl.2019.0589" xlink:type="simple">10.1098/rsbl.2019.0589</ext-link></comment> <object-id pub-id-type="pmid">32019463</object-id></mixed-citation>
</ref>
<ref id="pone.0291337.ref042">
<label>42</label>
<mixed-citation publication-type="journal" xlink:type="simple">
<name name-style="western"><surname>Linders</surname> <given-names>GM</given-names></name>, <name name-style="western"><surname>Louwerse</surname> <given-names>MM</given-names></name>. <article-title>Zipf’s law revisited: Spoken dialog, linguistic units, parameters, and the principle of least effort</article-title>. <source>Psychonomic Bulletin &amp; Review</source>. <year>2023</year>;<volume>30</volume>(<issue>1</issue>):<fpage>77</fpage>–<lpage>101</lpage>. <comment>doi: <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3758/s13423-022-02142-9" xlink:type="simple">10.3758/s13423-022-02142-9</ext-link></comment> <object-id pub-id-type="pmid">35840837</object-id></mixed-citation>
</ref>
</ref-list>
</back>
<sub-article article-type="aggregated-review-documents" id="pone.0291337.r001" specific-use="decision-letter">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pone.0291337.r001</article-id>
<title-group>
<article-title>Decision Letter 0</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name name-style="western">
<surname>De Benedictis</surname>
<given-names>Luca</given-names>
</name>
<role>Academic Editor</role>
</contrib>
</contrib-group>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Luca De Benedictis</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<related-object document-id="10.1371/journal.pone.0291337" document-id-type="doi" document-type="article" id="rel-obj001" link-type="peer-reviewed-article"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>0</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="letter-date">1 Jun 2023</named-content>
</p>
<p><!-- <div> -->PONE-D-23-08610<!-- </div> --><!-- <div> -->Benford's Law Applies to Word Frequency Rank in English, German, French, Spanish, and Italian<!-- </div> --><!-- <div> -->PLOS ONE</p>
<p>Dear Dr. Golbeck,</p>
<p>Thank you for submitting your manuscript to PLOS ONE. After careful consideration, we feel that it has merit but does not fully meet PLOS ONE’s publication criteria as it currently stands. Therefore, we invite you to submit a revised version of the manuscript that addresses the points raised during the review process.</p>
<p>Please submit your revised manuscript by Jul 16 2023 11:59PM. If you will need more time than this to complete your revisions, please reply to this message or contact the journal office at <email xlink:type="simple">plosone@plos.org</email>. When you're ready to submit your revision, log on to <ext-link ext-link-type="uri" xlink:href="https://www.editorialmanager.com/pone/" xlink:type="simple">https://www.editorialmanager.com/pone/</ext-link> and select the 'Submissions Needing Revision' folder to locate your manuscript file.</p>
<p>Please include the following items when submitting your revised manuscript:<!-- </div> --><list list-type="bullet"><list-item><p>A rebuttal letter that responds to each point raised by the academic editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'.</p></list-item><list-item><p>A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'.</p></list-item><list-item><p>An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'.</p></list-item></list></p>
<p>If you would like to make changes to your financial disclosure, please include your updated statement in your cover letter. Guidelines for resubmitting your figure files are available below the reviewer comments at the end of this letter.</p>
<p>If applicable, we recommend that you deposit your laboratory protocols in protocols.io to enhance the reproducibility of your results. Protocols.io assigns your protocol its own identifier (DOI) so that it can be cited independently in the future. For instructions see: <ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/plosone/s/submission-guidelines#loc-laboratory-protocols" xlink:type="simple">https://journals.plos.org/plosone/s/submission-guidelines#loc-laboratory-protocols</ext-link>. Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at <ext-link ext-link-type="uri" xlink:href="https://plos.org/protocols?utm_medium=editorial-email&amp;utm_source=authorletters&amp;utm_campaign=protocols" xlink:type="simple">https://plos.org/protocols?utm_medium=editorial-email&amp;utm_source=authorletters&amp;utm_campaign=protocols</ext-link>.</p>
<p>We look forward to receiving your revised manuscript.</p>
<p>Kind regards,</p>
<p>Luca De Benedictis, PhD</p>
<p>Academic Editor</p>
<p>PLOS ONE</p>
<p>Journal Requirements:</p>
<p>When submitting your revision, we need you to address these additional requirements.</p>
<p>1. Please ensure that your manuscript meets PLOS ONE's style requirements, including those for file naming. The PLOS ONE style templates can be found at </p>
<p><ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/plosone/s/file?id=wjVg/PLOSOne_formatting_sample_main_body.pdf" xlink:type="simple">https://journals.plos.org/plosone/s/file?id=wjVg/PLOSOne_formatting_sample_main_body.pdf</ext-link> and </p>
<p><ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/plosone/s/file?id=ba62/PLOSOne_formatting_sample_title_authors_affiliations.pdf" xlink:type="simple">https://journals.plos.org/plosone/s/file?id=ba62/PLOSOne_formatting_sample_title_authors_affiliations.pdf</ext-link></p>
<p>[Note: HTML markup is below. Please do not edit.]</p>
<p>Reviewers' comments:</p>
<p>Reviewer's Responses to Questions</p>
<p><!-- <font color="black"> --><bold>Comments to the Author</bold></p>
<p>1. Is the manuscript technically sound, and do the data support the conclusions?</p>
<p>The manuscript must describe a technically sound piece of scientific research with data that supports the conclusions. Experiments must have been conducted rigorously, with appropriate controls, replication, and sample sizes. The conclusions must be drawn appropriately based on the data presented. <!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->2. Has the statistical analysis been performed appropriately and rigorously? <!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->3. Have the authors made all data underlying the findings in their manuscript fully available?</p>
<p>The <ext-link ext-link-type="uri" xlink:href="http://www.plosone.org/static/policies.action#sharing" xlink:type="simple">PLOS Data policy</ext-link> requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.<!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->4. Is the manuscript presented in an intelligible fashion and written in standard English?</p>
<p>PLOS ONE does not copyedit accepted manuscripts, so the language in submitted articles must be clear, correct, and unambiguous. Any typographical or grammatical errors should be corrected at revision, so please note any specific errors here.<!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->5. Review Comments to the Author</p>
<p>Please use the space provided to explain your answers to the questions above. You may also include additional comments for the author, including concerns about dual publication, research ethics, or publication ethics. (Please upload your review as an attachment if it exceeds 20,000 characters)<!-- </font> --></p>
<p>Reviewer #1: PONE-D-23-08610</p>
<p>Reviewer comments</p>
<p>The present paper demonstrates that Benford's Law applies to ranked word frequencies in English, German, French, Spanish, and Italian. The author(s) computed the word frequency ranks using the Google Ngram Viewer corpus to prove this. By examining the first significant digit of the frequency ranks, the author(s) shows that the distribution of frequencies adheres to the expected pattern outlined by Benford's Law. Furthermore, across various sources such as news, books, and social media the author(s) investigated, we consistently found conformity to Benford's Law. Moreover, the authors analysed users' posts on social media and discovered that the vast majority of collected posts followed Benford's Law, while significant deviations from this pattern often indicated the presence of spam bots.</p>
<p>Introduction</p>
<p>In referring to Benford’s law studies in general and specifically on the stock market, more recent works may help contextualise. For example, Ausloos, M., Ficcadenti, V., Dhesi, G., &amp; Shakeel, M. (2021). Benford’s laws tests on S&amp;P500 daily closing values and the corresponding daily log-returns both point to huge non-conformity. Physica A: Statistical Mechanics and its Applications, 574, 125969.</p>
<p>The following statement should be simplified in favour of readers not familiar with Google 1-gram corpora. Furthermore, it is unclear what is intended by word’s frequency rank; namely, have you applied Benford’s law on the ranks or the frequencies? It may become clearer later in the text, but I feel it is important to say it here. Finally, what is “gold standard” in this context?</p>
<p>“We conducted an analysis of language use in a variety of corpra. To determine a word's frequency rank (e.g. what is the 314th most popular word in English), we measured frequency using the Google 1-gram corpra (reviewer’s note: CORRECT THE TYPO HERE) for English, German, French, 13 Spanish, and Italian. These frequency ranks were used as the gold standard rank in each language.”</p>
<p>A similar comment on the clarity of what “rank” and what “frequency” are under investigation should be applied to the paragraph related to social media posts.</p>
<p>Background and Related Work</p>
<p>This section could be improved by adding a practical example of the type of analysis that can be done with Benford’s law in linguistics. For example, mentioning a word, its rank in a corpus, and the way to consider its frequency. This comment is connected with the one made above about clarity.</p>
<p>Establishing Word Frequency Rank</p>
<p>One reads, “Google makes frequency counts available for each word. To calculate frequency and frequency rank, we first removed tokens that were not words (numbers, punctuation) and then sorted by frequency. We assigned each word a frequency rank beginning at 1 for the most popular word (e.g. “the" in the English corpus).” taken that a corpus is a book and that a corpora is a collection of books in a given language, does one have a rank for each word in every corpus? So, for example, one has N English books, each having a number of words and associated frequencies. I understand from the Results sections that words are considered altogether. Namely, one gets “approximately 1 trillion words” with their frequencies and ranks for English, correct? If so, I suggest to clarify here.</p>
<p>Additional Corpra</p>
<p>When the author(s) starts this section, the analysis and its results are not presented yet, but the basement of the sub-section is a need to validate the results. This is understandable, but a more thoughtful discussion of the potential results and their generalisability is necessary before introducing a “validation” argument.</p>
<p>In the following statement, “If Benford's Law applies robustly to language use, it should be observable in many contexts, corpra of many sizes, and both balanced and unbalanced corpra.” what does “balanced” mean?</p>
<p>Results</p>
<p>In this section, one finally understands, with an example, the concept of “frequency rank”. The usage of this approach is partially justified in the section “Rank-frequency distribution, Zipf's Law, and Language” but it is not enough because the obvious thought I had by reading is “why not use the frequencies directly?” I like the idea of using the ranking, so I am not discouraging, but some more on the reasons, the benefit of it, might be beneficial.</p>
<p>User-Level Analysis on Social Media</p>
<p>The methodology here must be clarified. Is the analysis based again on the “frequency rank”?</p>
<p>I do not get if the conclusion related to the fact that “bot” social network accounts are less Benford’s law compliant comes from a visual inspection or if it is possible to have some statistical test to validate that point.</p>
<p>Conclusions:</p>
<p>If the author(s) decides to keep any of the comments on board, please revise the conclusion accordingly. Furthermore, I suggest that, given the quality of the results in the field, more academically informed conclusive remarks can be given on the areas covered: the linguistic aspect and the social network component.</p>
<p>General comments:</p>
<p>When one removes non-standard text, I refer, e.g. to “Other non-standard words are unlikely to appear in the Google corpra and will be ignored” there might be a “manipulation” of the data that somewhat connect to what is done in the case of accountancy when some figures are systematically changed. Therefore, extra care should be used. Some of those words might be neologisms, words that are outside current dictionaries but in use in “hurban” conversation; this is especially relevant for the component of the analysis related to social networks. My question would be, does consider words in official dictionaries or including those not-in-dictionaries would change the results drastically? If it is not possible to re-do the analysis, I understand. I am not necessarily asking for that, but a few comments on the impact on Benford’s law validity would help. This is partially there already when the %s are reported, but a clear statement where one says that these numbers are not enough for breaking Benford’s law may reassure a reader. For example in “Ausloos, M., Ficcadenti, V., Dhesi, G., &amp; Shakeel, M. (2021). Benford’s laws tests on S&amp;P500 daily closing values and the corresponding daily log-returns both point to huge non-conformity. Physica A: Statistical Mechanics and its Applications, 574, 125969” a point regarding the inclusion or exclusion of the “zeros” from the returns analysis is made when evaluating the second digit law.</p>
<p>Check the usage of the words “corpora” and “corpus” I feel sometimes the usage of the words is interchanged, but the meaning is different.</p>
<p>Congratulations on using genuine and non-genuine accounts for the analysis related to the bots! I really like it!</p>
<p>**********</p>
<p><!-- <font color="black"> -->6. PLOS authors have the option to publish the peer review history of their article (<ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/plosone/s/editorial-and-peer-review-process#loc-peer-review-history" xlink:type="simple">what does this mean?</ext-link>). If published, this will include your full peer review and any attached files.</p>
<p>If you choose “no”, your identity will remain anonymous but your review may still be made public.</p>
<p><bold>Do you want your identity to be public for this peer review?</bold> For information about this choice, including consent withdrawal, please see our <ext-link ext-link-type="uri" xlink:href="https://www.plos.org/privacy-policy" xlink:type="simple">Privacy Policy</ext-link>.<!-- </font> --></p>
<p>Reviewer #1: No</p>
<p>**********</p>
<p>[NOTE: If reviewer comments were submitted as an attachment file, they will be attached to this email and accessible via the submission site. Please log into your account, locate the manuscript record, and check for the action link "View Attachments". If this link does not appear, there are no attachment files.]</p>
<p>While revising your submission, please upload your figure files to the Preflight Analysis and Conversion Engine (PACE) digital diagnostic tool, <ext-link ext-link-type="uri" xlink:href="https://pacev2.apexcovantage.com/" xlink:type="simple">https://pacev2.apexcovantage.com/</ext-link>. PACE helps ensure that figures meet PLOS requirements. To use PACE, you must first register as a user. Registration is free. Then, login and navigate to the UPLOAD tab, where you will find detailed instructions on how to use the tool. If you encounter any issues or have any questions when using PACE, please email PLOS at <email xlink:type="simple">figures@plos.org</email>. Please note that Supporting Information files do not need this step.</p>
<supplementary-material id="pone.0291337.s001" mimetype="application/pdf" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.s001" xlink:type="simple">
<label>Attachment</label>
<caption>
<p>Submitted filename: <named-content content-type="submitted-filename">Reviewer report PONE-D-23-08610.pdf</named-content></p>
</caption>
</supplementary-material>
</body>
</sub-article>
<sub-article article-type="author-comment" id="pone.0291337.r002">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pone.0291337.r002</article-id>
<title-group>
<article-title>Author response to Decision Letter 0</article-title>
</title-group>
<related-object document-id="10.1371/journal.pone.0291337" document-id-type="doi" document-type="peer-reviewed-article" id="rel-obj002" link-type="rebutted-decision-letter" object-id="10.1371/journal.pone.0291337.r001" object-id-type="doi" object-type="decision-letter"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>1</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="author-response-date">2 Jun 2023</named-content>
</p>
<p>(this response is also included as a submission document)</p>
<p>Response to Reviewers</p>
<p>Thank you so much for these very helpful comments. They have allowed us to make the paper much better and have been a tremendous help to the clarity. Below we have listed the reviewer comments in black and our responses in blue. We made all the changes requested by the reviewers.</p>
<p>Introduction</p>
<p>In referring to Benford’s law studies in general and specifically on the stock market, more recent works may help contextualise. For example, Ausloos, M., Ficcadenti, V., Dhesi, G., &amp; Shakeel, M. (2021). Benford’s laws tests on S&amp;P500 daily closing values and the corresponding daily log-returns both point to huge non-conformity. Physica A: Statistical Mechanics and its Applications, 574, 125969.</p>
<p>Thank you for this reference. We have added this to the introduction and also as a useful reference in the background to point out that Benford's law does not simply always apply in this type of data.</p>
<p>The following statement should be simplified in favour of readers not familiar with Google 1-gram corpora. Furthermore, it is unclear what is intended by word’s frequency rank; namely, have you applied Benford’s law on the ranks or the frequencies? It may become clearer later in the text, but I feel it is important to say it here. Finally, what is “gold standard” in this context?</p>
<p>“We conducted an analysis of language use in a variety of corpra. To determine a word's frequency rank (e.g. what is the 314th most popular word in English), we measured frequency using the Google 1-gram corpra (reviewer’s note: CORRECT THE TYPO HERE) for English, German, French, 13 Spanish, and Italian. These frequency ranks were used as the gold standard rank in each language.”</p>
<p>A similar comment on the clarity of what “rank” and what “frequency” are under investigation should be applied to the paragraph related to social media posts.</p>
<p>We have clarified this sentence, added background on the 1-gram corpora, and dropped "gold standard" from the paragraph for clarity.</p>
<p>We also moved the entire frequency rank discussion up to the introduction to address the many points about clarity raised by the reviewer.</p>
<p>Background and Related Work</p>
<p>This section could be improved by adding a practical example of the type of analysis that can be done with Benford’s law in linguistics. For example, mentioning a word, its rank in a corpus, and the way to consider its frequency. This comment is connected with the one made above about clarity.</p>
<p>This point should be addressed by the addition of the frequency rank discussion to the introduction.</p>
<p>Establishing Word Frequency Rank</p>
<p>One reads, “Google makes frequency counts available for each word. To calculate frequency and frequency rank, we first removed tokens that were not words (numbers, punctuation) and then sorted by frequency. We assigned each word a frequency rank beginning at 1 for the most popular word (e.g. “the" in the English corpus).” taken that a corpus is a book and that a corpora is a collection of books in a given language, does one have a rank for each word in every corpus? So, for example, one has N English books, each having a number of words and associated frequencies. I understand from the Results sections that words are considered altogether. Namely, one gets “approximately 1 trillion words” with their frequencies and ranks for English, correct? If so, I suggest to clarify here.</p>
<p>Google refers so their 1 Trillion Word dataset as a single corpus, rather than a corpora of all the books. After reviewing your comments (including one about corpora vs corpus below) think this is likely the source of the confusion. To clarify, we've updated the text to refer to the google data as a "dataset" (since it has more data in it than just words, anyway). </p>
<p>Additional Corpora</p>
<p>When the author(s) starts this section, the analysis and its results are not presented yet, but the basement of the sub-section is a need to validate the results. This is understandable, but a more thoughtful discussion of the potential results and their generalisability is necessary before introducing a “validation” argument.</p>
<p>We have added this discussion to the beginning of the Methods and Data section, just above Establishing Word Frequency Rank.</p>
<p>In the following statement, “If Benford's Law applies robustly to language use, it should be observable in many contexts, corpra of many sizes, and both balanced and unbalanced corpra.” what does “balanced” mean?</p>
<p>"Balanced" corpora are intended to reflect overall usage, including speaking, fictional writing, non-fiction, etc. Honestly, it's only a concept we encountered in the process of doing this work and is not critical to the paper, so we've updated this sentence to instead refer to data "from a variety of sources" which captures the idea without the jargon.</p>
<p>Results</p>
<p>In this section, one finally understands, with an example, the concept of “frequency rank”. The usage of this approach is partially justified in the section “Rank-frequency distribution, Zipf's Law, and Language” but it is not enough because the obvious thought I had by reading is “why not use the frequencies directly?” I like the idea of using the ranking, so I am not discouraging, but some more on the reasons, the benefit of it, might be beneficial.</p>
<p>Generally, statistical linguistics use frequency rank rather than just frequency because it allows for easy comparison between different datasets. The frequency of the word "and" will be quite different in a 1 trillion word dataset vs. a 10 million word one. Of course, that doesn’t really matter here for Benford's Law analysis, but it does matter for cross-dataset comparison. We could do a Benford test on the frequency counts within each dataset (which, incidentally, we did in early stages of this work and everything looks pretty Benford-y), but we wouldn't be comparing apples-to-apples across datasets then. Using the frequency rank lets us say for a language overall, here's the rank of each word, and we can check every dataset with that same rank. </p>
<p>This is an important point and we have added a more formal discussion of this point to the Methods and Data section.</p>
<p>User-Level Analysis on Social Media</p>
<p>The methodology here must be clarified. Is the analysis based again on the “frequency rank”?</p>
<p>I do not get if the conclusion related to the fact that “bot” social network accounts are less Benford’s law compliant comes from a visual inspection or if it is possible to have some statistical test to validate that point.</p>
<p>We have re-written this section to clarify the methodology. </p>
<p>For the Parler accounts, we made the conclusion about bot status based on a human analysis of their posts. We have re-written this paragraph to make that clearer.</p>
<p>Conclusions:</p>
<p>If the author(s) decides to keep any of the comments on board, please revise the conclusion accordingly. Furthermore, I suggest that, given the quality of the results in the field, more academically informed conclusive remarks can be given on the areas covered: the linguistic aspect and the social network component.</p>
<p>We have updated the conclusion to include additional discussion along these lines.</p>
<p>General comments:</p>
<p>When one removes non-standard text, I refer, e.g. to “Other non-standard words are unlikely to appear in the Google corpra and will be ignored” there might be a “manipulation” of the data that somewhat connect to what is done in the case of accountancy when some figures are systematically changed. Therefore, extra care should be used. Some of those words might be neologisms, words that are outside current dictionaries but in use in “hurban” conversation; this is especially relevant for the component of the analysis related to social networks. My question would be, does consider words in official dictionaries or including those not-in-dictionaries would change the results drastically? If it is not possible to re-do the analysis, I understand. I am not necessarily asking for that, but a few comments on the impact on Benford’s law validity would help. This is partially there already when the %s are reported, but a clear statement where one says that these numbers are not enough for breaking Benford’s law may reassure a reader. For example in “Ausloos, M., Ficcadenti, V., Dhesi, G., &amp; Shakeel, M. (2021). Benford’s laws tests on S&amp;P500 daily closing values and the corresponding daily log-returns both point to huge non-conformity. Physica A: Statistical Mechanics and its Applications, 574, 125969” a point regarding the inclusion or exclusion of the “zeros” from the returns analysis is made when evaluating the second digit law.</p>
<p>The challenge with these words is that, since they aren't in the Google dataset for each language, they do not have a frequency rank. These do not make a difference to the analysis – we point out in the Additional Corpora section that they are &lt;1% of the data. We agree that additional description of their impact on the validity is important and we have added that text along with a reference to the paper mentioned.</p>
<p>Check the usage of the words “corpora” and “corpus” I feel sometimes the usage of the words is interchanged, but the meaning is different.</p>
<p>Thanks for this – we had a consistent typo with "corpra" instead of "corpora" on top of all the other confusion. We were trying to use "corpora" simply as the plural of corpus. We hope this has been clarified in this version, but if we are unintentionally mis-using this still, we'd appreciate the feedback!</p>
<p>Congratulations on using genuine and non-genuine accounts for the analysis related to the bots! I really like it!</p>
<p>Thank you! We are so excited about these results!</p>
<supplementary-material id="pone.0291337.s002" mimetype="application/pdf" position="float" xlink:href="info:doi/10.1371/journal.pone.0291337.s002" xlink:type="simple">
<label>Attachment</label>
<caption>
<p>Submitted filename: <named-content content-type="submitted-filename">Response to Reviewers.pdf</named-content></p>
</caption>
</supplementary-material>
</body>
</sub-article>
<sub-article article-type="aggregated-review-documents" id="pone.0291337.r003" specific-use="decision-letter">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pone.0291337.r003</article-id>
<title-group>
<article-title>Decision Letter 1</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name name-style="western">
<surname>De Benedictis</surname>
<given-names>Luca</given-names>
</name>
<role>Academic Editor</role>
</contrib>
</contrib-group>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Luca De Benedictis</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<related-object document-id="10.1371/journal.pone.0291337" document-id-type="doi" document-type="article" id="rel-obj003" link-type="peer-reviewed-article"/>
<custom-meta-group>
<custom-meta>
<meta-name>Submission Version</meta-name>
<meta-value>1</meta-value>
</custom-meta>
</custom-meta-group>
</front-stub>
<body>
<p>
<named-content content-type="letter-date">29 Aug 2023</named-content>
</p>
<p>Benford's Law Applies to Word Frequency Rank in English, German, French, Spanish, and Italian</p>
<p>PONE-D-23-08610R1</p>
<p>Dear Dr. Golbeck,</p>
<p>We’re pleased to inform you that your manuscript has been judged scientifically suitable for publication and will be formally accepted for publication once it meets all outstanding technical requirements. Please, a careful final reading is recommended to spot remaining typos.</p>
<p>Within one week, you’ll receive an e-mail detailing the required amendments. When these have been addressed, you’ll receive a formal acceptance letter and your manuscript will be scheduled for publication.</p>
<p>An invoice for payment will follow shortly after the formal acceptance. To ensure an efficient process, please log into Editorial Manager at <ext-link ext-link-type="uri" xlink:href="http://www.editorialmanager.com/pone/" xlink:type="simple">http://www.editorialmanager.com/pone/</ext-link>, click the 'Update My Information' link at the top of the page, and double check that your user information is up-to-date. If you have any billing related questions, please contact our Author Billing department directly at <email xlink:type="simple">authorbilling@plos.org</email>.</p>
<p>If your institution or institutions have a press office, please notify them about your upcoming paper to help maximize its impact. If they’ll be preparing press materials, please inform our press team as soon as possible -- no later than 48 hours after receiving the formal acceptance. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information, please contact <email xlink:type="simple">onepress@plos.org</email>.</p>
<p>Kind regards,</p>
<p>Luca De Benedictis, PhD</p>
<p>Academic Editor</p>
<p>PLOS ONE</p>
<p><!-- <font color="black"> --><bold>Comments to the Author</bold><!-- </font> --></p>
<p>Reviewer #1: All comments have been addressed</p>
<p>**********</p>
<p><!-- <font color="black"> -->2. Is the manuscript technically sound, and do the data support the conclusions?</p>
<p>The manuscript must describe a technically sound piece of scientific research with data that supports the conclusions. Experiments must have been conducted rigorously, with appropriate controls, replication, and sample sizes. The conclusions must be drawn appropriately based on the data presented. <!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->3. Has the statistical analysis been performed appropriately and rigorously? <!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->4. Have the authors made all data underlying the findings in their manuscript fully available?</p>
<p>The <ext-link ext-link-type="uri" xlink:href="http://www.plosone.org/static/policies.action#sharing" xlink:type="simple">PLOS Data policy</ext-link> requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.<!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->5. Is the manuscript presented in an intelligible fashion and written in standard English?</p>
<p>PLOS ONE does not copyedit accepted manuscripts, so the language in submitted articles must be clear, correct, and unambiguous. Any typographical or grammatical errors should be corrected at revision, so please note any specific errors here.<!-- </font> --></p>
<p>Reviewer #1: Yes</p>
<p>**********</p>
<p><!-- <font color="black"> -->6. Review Comments to the Author</p>
<p>Please use the space provided to explain your answers to the questions above. You may also include additional comments for the author, including concerns about dual publication, research ethics, or publication ethics. (Please upload your review as an attachment if it exceeds 20,000 characters)<!-- </font> --></p>
<p>Reviewer #1: Very good work, extensive and properly executed. A careful final reading is recommended to spot remaining typos.</p>
<p>**********</p>
<p><!-- <font color="black"> -->7. PLOS authors have the option to publish the peer review history of their article (<ext-link ext-link-type="uri" xlink:href="https://journals.plos.org/plosone/s/editorial-and-peer-review-process#loc-peer-review-history" xlink:type="simple">what does this mean?</ext-link>). If published, this will include your full peer review and any attached files.</p>
<p>If you choose “no”, your identity will remain anonymous but your review may still be made public.</p>
<p><bold>Do you want your identity to be public for this peer review?</bold> For information about this choice, including consent withdrawal, please see our <ext-link ext-link-type="uri" xlink:href="https://www.plos.org/privacy-policy" xlink:type="simple">Privacy Policy</ext-link>.<!-- </font> --></p>
<p>Reviewer #1: No</p>
<p>**********</p>
</body>
</sub-article>
<sub-article article-type="editor-report" id="pone.0291337.r004" specific-use="acceptance-letter">
<front-stub>
<article-id pub-id-type="doi">10.1371/journal.pone.0291337.r004</article-id>
<title-group>
<article-title>Acceptance letter</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name name-style="western">
<surname>De Benedictis</surname>
<given-names>Luca</given-names>
</name>
<role>Academic Editor</role>
</contrib>
</contrib-group>
<permissions>
<copyright-year>2023</copyright-year>
<copyright-holder>Luca De Benedictis</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>This is an open access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/" xlink:type="simple">Creative Commons Attribution License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</license-p>
</license>
</permissions>
<related-object document-id="10.1371/journal.pone.0291337" document-id-type="doi" document-type="article" id="rel-obj004" link-type="peer-reviewed-article"/>
</front-stub>
<body>
<p>
<named-content content-type="letter-date">4 Sep 2023</named-content>
</p>
<p>PONE-D-23-08610R1 </p>
<p>Benford's Law Applies to Word Frequency Rank in English, German, French, Spanish, and Italian </p>
<p>Dear Dr. Golbeck:</p>
<p>I'm pleased to inform you that your manuscript has been deemed suitable for publication in PLOS ONE. Congratulations! Your manuscript is now with our production department. </p>
<p>If your institution or institutions have a press office, please let them know about your upcoming paper now to help maximize its impact. If they'll be preparing press materials, please inform our press team within the next 48 hours. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information please contact <email xlink:type="simple">onepress@plos.org</email>.</p>
<p>If we can help with anything else, please email us at <email xlink:type="simple">plosone@plos.org</email>. </p>
<p>Thank you for submitting your work to PLOS ONE and supporting open access. </p>
<p>Kind regards, </p>
<p>PLOS ONE Editorial Office Staff</p>
<p>on behalf of</p>
<p>Dr. Luca De Benedictis </p>
<p>Academic Editor</p>
<p>PLOS ONE</p>
</body>
</sub-article>
</article>