<!DOCTYPE article
PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20190208//EN"
       "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.4" xml:lang="en">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">MOSCOW ECONOMIC JOURNAL</journal-id>
   <journal-title-group>
    <journal-title xml:lang="en">MOSCOW ECONOMIC JOURNAL</journal-title>
    <trans-title-group xml:lang="ru">
     <trans-title>Московский экономический журнал</trans-title>
    </trans-title-group>
   </journal-title-group>
   <issn publication-format="online">2413-046X</issn>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="publisher-id">74491</article-id>
   <article-categories>
    <subj-group subj-group-type="toc-heading" xml:lang="ru">
     <subject>Отраслевая и региональная экономика</subject>
    </subj-group>
    <subj-group subj-group-type="toc-heading" xml:lang="en">
     <subject></subject>
    </subj-group>
    <subj-group>
     <subject>Отраслевая и региональная экономика</subject>
    </subj-group>
   </article-categories>
   <title-group>
    <article-title xml:lang="en">АНАЛИЗ ТЕКСТОВЫХ ДОКУМЕНТОВ САЙТА НА ОСНОВЕ ПРИМЕНЕНИЯ ЗАКОНА ЦИПФА</article-title>
    <trans-title-group xml:lang="ru">
     <trans-title>АНАЛИЗ ТЕКСТОВЫХ ДОКУМЕНТОВ САЙТА НА ОСНОВЕ ПРИМЕНЕНИЯ ЗАКОНА ЦИПФА</trans-title>
    </trans-title-group>
   </title-group>
   <contrib-group content-type="authors">
    <contrib contrib-type="author">
     <name-alternatives>
      <name xml:lang="ru">
       <surname>Плотников</surname>
       <given-names>Андрей Викторович</given-names>
      </name>
      <name xml:lang="en">
       <surname>Plotnikov</surname>
       <given-names>Andrey Viktorovich</given-names>
      </name>
     </name-alternatives>
     <email>andreiplotnikovwork@gmail.com</email>
     <xref ref-type="aff" rid="aff-1"/>
    </contrib>
   </contrib-group>
   <aff-alternatives id="aff-1">
    <aff>
     <institution xml:lang="ru">Пермский государственный аграрно-технологический университет имени академика Д.Н. Прянишникова</institution>
     <country>ru</country>
    </aff>
    <aff>
     <institution xml:lang="en">Пермский государственный аграрно-технологический университет имени академика Д.Н. Прянишникова</institution>
     <country>ru</country>
    </aff>
   </aff-alternatives>
   <pub-date publication-format="print" date-type="pub" iso-8601-date="2017-12-25T14:01:20+03:00">
    <day>25</day>
    <month>12</month>
    <year>2017</year>
   </pub-date>
   <pub-date publication-format="electronic" date-type="pub" iso-8601-date="2017-12-25T14:01:20+03:00">
    <day>25</day>
    <month>12</month>
    <year>2017</year>
   </pub-date>
   <volume>2</volume>
   <issue>5</issue>
   <fpage>6</fpage>
   <lpage>6</lpage>
   <history>
    <date date-type="received" iso-8601-date="2017-12-07T14:01:20+03:00">
     <day>07</day>
     <month>12</month>
     <year>2017</year>
    </date>
    <date date-type="accepted" iso-8601-date="2017-12-15T14:01:20+03:00">
     <day>15</day>
     <month>12</month>
     <year>2017</year>
    </date>
   </history>
   <self-uri xlink:href="https://qje.su/en/nauka/article/74491/view">https://qje.su/en/nauka/article/74491/view</self-uri>
   <abstract xml:lang="ru">
    <p>Почти 70 лет назад, лингвистом из Гарварда Джорджем Ципфом был сформулирован эмпирико-математический закон, отражающий для любого естественного языка связи типа «ранг - частота»: слова весьма протяженного текста (в потенциале - языка), если лексикографически упорядочить их по используемости, то у слова ряда с номером n частота будет «почти» обратно пропорциональна рангу, числу n. В частности, второе по частотности слово будет встречаться вдвое реже первого, третье - реже первого и второго и т.д. На основе применения Закона Ципфа проведен анализ web-страниц сайтов на предмет естественности.</p>
   </abstract>
   <trans-abstract xml:lang="en">
    <p>Almost 70 years ago, a linguist from Harvard George Zipf formulated an empirical-mathematical law that reflects for any natural language the connection of the &quot;rank-frequency&quot; type: words of a very long text (in the potential of language), if lexicographically order them according to their use, then the word series with the number n, the frequency will be &quot;almost&quot; inversely proportional to the rank, the number n. In particular, the second most frequent word will occur twice as rarely as the first, the third - less often than the first three times, etc. Based on the application of the Zipf Law, an analysis of the web pages of sites on the subject of naturalness has been carried out.</p>
   </trans-abstract>
   <kwd-group xml:lang="ru">
    <kwd>закон Ципфа</kwd>
    <kwd>контент-маркетинг</kwd>
    <kwd>интернет-маркетинг</kwd>
    <kwd>поисковая оптимизация</kwd>
   </kwd-group>
   <kwd-group xml:lang="en">
    <kwd>Zipf's law</kwd>
    <kwd>content marketing</kwd>
    <kwd>internet-marketing</kwd>
    <kwd>search engine optimization</kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <p>Almost 70 years ago, a linguist from Harvard George Zipf formulated an empirical-mathematical law that reflects for any natural language the connection of the &quot;rank-frequency&quot; type: words of a very long text (in the potential of language), if lexicographically order them according to their use, then the word series with the number n, the frequency will be &quot;almost&quot; inversely proportional to the rank, the number n. In particular, the second most frequent word will occur twice as rarely as the first, the third - less often than the first three times, etc. Based on the application of the Zipf Law, an analysis of the web pages of sites on the subject of naturalness has been carried out.</p>
 </body>
 <back>
  <ref-list/>
 </back>
</article>
