<?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">kaz29</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Казахстанско-Британского технического университета</journal-title><trans-title-group xml:lang="en"><trans-title>Herald of the Kazakh-British Technical University</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6688</issn><issn pub-type="epub">2959-8109</issn><publisher><publisher-name>Казахстанско-Британский Технический Университет</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">kaz29-164</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>PHYSICAL, MATHEMATICAL AND TECHNICAL SCIENCES</subject></subj-group></article-categories><title-group><article-title>ОБЗОР РАЗЛИЧНЫХ МЕТОДОВ ОБОБЩЕНИЯ ТЕКСТА</article-title><trans-title-group xml:lang="en"><trans-title>OVERVIEW OF THE DIFFERENT TEXT SUMMARIZATION METHODS</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>Dauit</surname><given-names>D.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p></bio><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>Kemalov</surname><given-names>M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p></bio><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>Jaksylykova</surname><given-names>A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>докторант</p></bio><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">АО "КБТУ"<country>Казахстан</country></aff><aff xml:lang="en">Kazakh-British Technical University<country>Kazakhstan</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru">Казахский Национальный университет им. аль-Фараби, Институт информационных и вычислительных технологий<country>Казахстан</country></aff><aff xml:lang="en">Kazakh-British Technical University<country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>07</day><month>11</month><year>2021</year></pub-date><volume>17</volume><issue>2</issue><fpage>163</fpage><lpage>168</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Дауит Д.М., Кемалов М.М., Джаксылыкова А.Б., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Дауит Д.М., Кемалов М.М., Джаксылыкова А.Б.</copyright-holder><copyright-holder xml:lang="en">Dauit D., Kemalov M., Jaksylykova A.</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://vestnik.kbtu.edu.kz/jour/article/view/164">https://vestnik.kbtu.edu.kz/jour/article/view/164</self-uri><abstract><p>Суммаризация текста является одной из основных проблем, поскольку имеет широкий диапазон использования в различных областях, и наиболее важно иметь улучшенный механизм для быстрого и эффективного извлечения информации. Извлечение резюме из всего этого доступного источника текстовых данных вручную очень сложно. Для того, чтобы показать способы решения проблемы суммирования текста, в данной статье представлен краткий обзор различных методов суммирования текста, таких как MatchSum (Zhong et al., 2020), BertSumExt (Liu и Lapata 2019) и SemSim (Yoon et al., 2020). ), которые показали наилучшие результаты в обобщении текста. В данной статье рассматриваются эти модели, показаны их преимущества и недостатки, и даются предположения, как можно улучшить суммаризацию текста.</p></abstract><trans-abstract xml:lang="en"><p>Text summarization is one of the major problems because it has a high range of usage in various fields, it is most important to have an improved mechanism for the fastest and most effective extraction of the information. The extraction of the summary from all that available source of text data by hand is very difficult. In order to show the ways for solving the text summarization, this paper presents a brief survey of various text summarization methods like MatchSum (Zhong et al., 2020), BertSumExt (Liu and Lapata 2019) and SemSim (Yoon et al., 2020) which has shown the leading results in extractive and abstractive text summarization. This paper reviews those models and shows their advantages and disadvantages, makes a guess how text summarization can be improved.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>методы суммирования текста</kwd><kwd>обработка на естественном языке (NLP)</kwd><kwd>BertSumExt</kwd><kwd>MatchSum</kwd><kwd>SemSim</kwd></kwd-group><kwd-group xml:lang="en"><kwd>text summarization methods</kwd><kwd>natural language processing (NLP)</kwd><kwd>BertSumExt</kwd><kwd>MatchSum</kwd><kwd>SemSim)</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">Lewis M. et al. Bart: Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension //arXiv preprint arXiv: 1910.13461. – 2019.</mixed-citation><mixed-citation xml:lang="en">Lewis M. et al. Bart: Denoising sequence-to-sequence pre-training for natural language generation, translation, and comprehension //arXiv preprint arXiv: 1910.13461. – 2019.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Hermann K. M. et al. Teaching Machines to Read and Comprehend. arXiv. – 2015.</mixed-citation><mixed-citation xml:lang="en">Hermann K. M. et al. Teaching Machines to Read and Comprehend. arXiv. – 2015.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Zhong M. et al. Extractive Summarization as Text Matching //arXiv preprint arXiv:2004.08795. – 2020.</mixed-citation><mixed-citation xml:lang="en">Zhong M. et al. Extractive Summarization as Text Matching //arXiv preprint arXiv:2004.08795. – 2020.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Liu Y., Lapata M. Text summarization with pretrained encoders //arXiv preprint arXiv:1908.08345. – 2019.</mixed-citation><mixed-citation xml:lang="en">Liu Y., Lapata M. Text summarization with pretrained encoders //arXiv preprint arXiv:1908.08345. – 2019.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Yoon, Wonjin, et al. Learning by Semantic Similarity Makes Abstractive Summarization Better. 2020, http://arxiv.org/abs/2002.07767.</mixed-citation><mixed-citation xml:lang="en">Yoon, Wonjin, et al. Learning by Semantic Similarity Makes Abstractive Summarization Better. 2020, http://arxiv.org/abs/2002.07767.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">NLP progress, summarization. URL: http://nlpprogress.com/english/summarization.html</mixed-citation><mixed-citation xml:lang="en">NLP progress, summarization. URL: http://nlpprogress.com/english/summarization.html</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>
