<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">cheb</journal-id><journal-title-group><journal-title xml:lang="ru">Чебышевский сборник</journal-title><trans-title-group xml:lang="en"><trans-title>Chebyshevskii Sbornik</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-8383</issn><publisher><publisher-name>Tula State Lev Tolstoy  Pedagogical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22405/2226-8383-2022-23-2-151-160</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-1275</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Article</subject></subj-group></article-categories><title-group><article-title>Построение и анализ моделей русского языка в связи с исследованиями криптографических алгоритмов</article-title><trans-title-group xml:lang="en"><trans-title>The construction and analysis of the Russian language models for a cryptographic algorithm research</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Малашина</surname><given-names>Анастасия Геннадьевна</given-names></name><name name-style="western" xml:lang="en"><surname>Malashina</surname><given-names>Anastasia Gennad’evna</given-names></name></name-alternatives><bio xml:lang="ru"/><email xlink:type="simple">amalashina@hse.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Лось</surname><given-names>Алексей Борисович</given-names></name><name name-style="western" xml:lang="en"><surname>Los</surname><given-names>Alexey Borisovich</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат технических наук, доцент </p></bio><bio xml:lang="en"><p>candidate of technical sciences, assosiate professor</p></bio><email xlink:type="simple">alos@hse.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Национальный исследовательский университет&#13;
«Высшая школа экономики»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>National Research University «Higher School of Economics»</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Национальный исследовательский университет «Высшая школа экономики»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>National Research University «Higher School of Economics»</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>07</day><month>07</month><year>2022</year></pub-date><volume>23</volume><issue>2</issue><fpage>151</fpage><lpage>160</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Малашина А.Г., Лось А.Б., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Малашина А.Г., Лось А.Б.</copyright-holder><copyright-holder xml:lang="en">Malashina A.G., Los A.B.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.chebsbornik.ru/jour/article/view/1275">https://www.chebsbornik.ru/jour/article/view/1275</self-uri><abstract><p>При исследовании криптографических качеств алгоритмов защиты информации важным моментом является построение теоретических и экспериментальных моделей источников сообщений. В данной статье проводится статистический анализ свойств лексических и n-граммных моделей русского языка на основе новостного текстового корпуса. Созданспециализированный корпус из новостных статей последних лет политической направленности, отражающий узкую область употребления языка. Составлены словари токенов иn-грамм, найдены величины покрытия этих словарей, а также значения энтропии. Проведена лемматизация исходного текстового корпуса и экстраполяция роста объёма словарейв зависимости от увеличения размера корпуса.</p></abstract><trans-abstract xml:lang="en"><p>The article provides a statistical analysis of the properties of lexical and n-gram models of the Russian language based on the news text corpus. A specialized corpus of political news articles of recent years has been created, reflecting a narrow area of language use. The token and n-gram dictionaries are compiled, the coverage values are found, as well as the values ofentropy. Lemmatization of the original text corpus and extrapolation of the dictionary volumes are performed.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>словари n-грамм</kwd><kwd>энтропия n-грамм</kwd><kwd>осмысленные тексты.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>n-gram dictionaries</kwd><kwd>n-gram entropy</kwd><kwd>meaningful texts.</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Алферов А. П., Зубов А. Ю., Кузьмин А. С., Черемушкин А. В., Основы криптографии: учебное пособие. 3-е изд., испр. и доп. // М.: Гелиос АРВ, 2005. – 408 с.</mixed-citation><mixed-citation xml:lang="en">Alferov A.P., Zubov A. Ju., Kuz’min A. S. &amp; Cheremushkin A. V. 2005, “Fundamentals of cryptography: textbook: 3rd ed., ISPR. and add.”[“Osnovy kriptografii: uchebnoe posobie: 3-e</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Бабаш А. В., Шанкин Г. П., Криптография, Москва: СОЛОН-ПРЕСС, 2007.</mixed-citation><mixed-citation xml:lang="en">izd., ispr. i dop.”], Gelios ARV, p. 408.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Викторов А. Б., Грамницкий С. Г., Гордеев С. С., Ескевич М. В. и Климина Е. М. Универсальная методика подготовки компонентов обучения систем распознавания речи //</mixed-citation><mixed-citation xml:lang="en">Babash A. V. &amp; Shankin G.P. 2007, “Cryptography” [“Kriptografija”], SOLON-PRESS.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Речевые технологии, pp. 39-56, Февраль 2009.</mixed-citation><mixed-citation xml:lang="en">Viktorov A. B., Gramnickij S. G., Gordeev S. S., Eskevich M. V. &amp; Klimina E. M. 2009, “The universal method for preparing speech recognition system training components” [“Universal’-</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Волосатова Т. М., Информатика и лингвистика: учеб. пособие, Волосатова Т. М. и Чичварин Н. В. // ИНФРА-М, 2018, 196 с.</mixed-citation><mixed-citation xml:lang="en">naja metodika podgotovki komponentov obuchenija sistem raspoznavanija rechi”], Rechevye tehnologii, pp. 39-56.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Кипяткова И. С. Исследование статистических n-граммных моделей языка для распознавания слитной русской речи со сверхбольшим словарем // Анализ разговорной русской</mixed-citation><mixed-citation xml:lang="en">Volosatova T. M. &amp; Chichvarin N. V. 2018, “Computer science and linguistics: textbook” [“Informatika i lingvistika: ucheb. posobie”], INFRA-M, p.196.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">речи , Санкт-Петербург, 2010.</mixed-citation><mixed-citation xml:lang="en">Kipjatkova I. S. 2010, “Research of statistical N-gram language models for recognition of merged Russian speech with a super-large dictionary” [“Issledovanie statisticheskih n-grammnyh modelej jazyka dlja raspoznavanija slitnoj russkoj rechi so sverhbol’shim slovarem”], Analiz razgovornoj russkoj rechi, Sankt-Peterburg.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Малашина А. Г. Алгоритм восстановления отдельных частей сообщения по информации о возможных значениях его знаков, Материалы конференции // Межвузовская научно-техническая конференция студентов, аспирантов и молодых специалистов имени Е.В. Арменского. – Москва, 2019. C. 215-217.</mixed-citation><mixed-citation xml:lang="en">Malashina A. G. 2019, “The algorithm for recovering discrete message parts based on information about possible values of its characters. Proc.” [“Algoritm vosstanovlenija otdel’nyh</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Шеннон К., Работы по теории информации и кибернетике // М: Издательство иностранной литературы, 1963.</mixed-citation><mixed-citation xml:lang="en">chastej soobshhenija po informacii o vozmozhnyh znachenijah ego znakov. Materialy konferencii”], Mezhvuzovskaja nauchno-tehnicheskaja konferencija studentov, aspirantov i molodyh</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Яглом А. М., Яглом И. М., Вероятность и информация: 3-е изд., испр. и доп. // М: издательство «Наука», 1973, 236-290 с.</mixed-citation><mixed-citation xml:lang="en">specialistov imeni E.V. Armenskogo, Moscow, pp. 215-217.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Bellegarda J. R. Robustness in Statistical Language Modeling // Robustness in Language and Speech Technology , Springer Science+Business Media Dordrecht, 2001, pp. 104-106.</mixed-citation><mixed-citation xml:lang="en">Shennon C. E. 1963, “Works on information theory and Cybernetics” [“Raboty po teorii informacii i kibernetike”], Izdatel’stvo inostrannoj literatury.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Chase L., Rosenfeld R., Ward W. Error-responsive modifications to speech recognizers: negative n-grams // Third International Conference on Spoken Language Processing, Yokohama, 1994.</mixed-citation><mixed-citation xml:lang="en">Jaglom A. M. &amp; Jaglom I. M. 1973, “Probability and information: 3rd ed., cor. and exp.” [“Verojatnost’ i informacija: 3-e izd., ispr. i dop.”], Nauka, pp. 236-290.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Florencio D., Herley C. A Large-Scale Study of Web Password Habits // Proceeds of the International World Wide Web Conference Committee, 2015.</mixed-citation><mixed-citation xml:lang="en">Bellegarda J. R. 2001, “Robustness in Statistical Language Modeling”, Robustness in Language and Speech Technology , Springer Science+Business Media Dordrecht, pp. 104-106.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Gelbukh A., Sidorov G. Zipf and Heaps Laws’ Coefficients Depend on Language // Conference on Intelligent Text Processing and Computational Linguistics, Mexico City, 2001.</mixed-citation><mixed-citation xml:lang="en">Chase L., Rosenfeld R. &amp; Ward W. 1994, “Error-responsive modifications to speech recognizers: negative n-grams”, Third International Conference on Spoken Language Processing.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Kechedzhy K. E. Rank distributions of words in additive many-step Markov chaons and the Zipf law // Phys. Rev. E. – 2005 – Vol. 72.</mixed-citation><mixed-citation xml:lang="en">Florencio, D. &amp; Herley, C. 2007, “A Large-Scale Study of Web Password Habits”, Proceeds of the International World Wide Web Conference Committee.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Massey J. Guessing and entropy // Proceedings of 1994 IEEE International Symposium on Information Theory. IEEE. p. 204.</mixed-citation><mixed-citation xml:lang="en">Gelbukh A. &amp; Sidorov G. 2001, “Zipf and Heaps Laws’ Coefficients Depend on Language”, Conference on Intelligent Text Processing and Computational Linguistics.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Rosenfeld R. Optimizing lexical and n-gram coverage via judicious use of linguistic data // Proceedings of the Fourth European Conference on Speech Communication and Technology – Madrid, 1995.</mixed-citation><mixed-citation xml:lang="en">Kechedzhy K. E., Usatenko K. E. &amp; V. A. Yampol’skii 2005, “Rank distributions of words in additive many-step Markov chaons and the Zipf law”, Phys. Rev. E., vol. 72.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Massey J. 1994, “Guessing and entropy”, Proceedings of 1994 IEEE International Symposium on Information Theory, p. 204.</mixed-citation><mixed-citation xml:lang="en">Massey J. 1994, “Guessing and entropy”, Proceedings of 1994 IEEE International Symposium on Information Theory, p. 204.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Rosenfeld R. 1995, “Optimizing lexical and n-gram coverage via judicious use of linguistic data”, Proceedings of the Fourth European Conference on Speech Communication and Technology.</mixed-citation><mixed-citation xml:lang="en">Rosenfeld R. 1995, “Optimizing lexical and n-gram coverage via judicious use of linguistic data”, Proceedings of the Fourth European Conference on Speech Communication and Technology.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
