<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article article-type="research-article" dtd-version="1.2" xml:lang="ru" 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="issn">2518-1092</journal-id><journal-title-group><journal-title>Research result. Information technologies</journal-title></journal-title-group><issn pub-type="epub">2518-1092</issn></journal-meta><article-meta><article-id pub-id-type="doi">10.18413/2518-1092-2026-11-3-0-4</article-id><article-id pub-id-type="publisher-id">4357</article-id><article-categories><subj-group subj-group-type="heading"><subject>ARTIFICIAL INTELLIGENCE AND DECISION MAKING</subject></subj-group></article-categories><title-group><article-title>&lt;strong&gt;OPTIMIZATION OF A HYBRID SEARCH ALGORITHM IN TEXT CORPUSA BASED ON MULTI-LEVEL RELEVANCE METRICS&lt;/strong&gt;</article-title><trans-title-group xml:lang="en"><trans-title>&lt;strong&gt;OPTIMIZATION OF A HYBRID SEARCH ALGORITHM IN TEXT CORPUSA BASED ON MULTI-LEVEL RELEVANCE METRICS&lt;/strong&gt;</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="ru"><surname>Levina</surname><given-names>Tatyana Mikhailovna</given-names></name><name xml:lang="en"><surname>Levina</surname><given-names>Tatyana Mikhailovna</given-names></name></name-alternatives><email>tattin76@mail.ru</email></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="ru"><surname>Belyakov</surname><given-names>Yaroslav Vadimovich</given-names></name><name xml:lang="en"><surname>Belyakov</surname><given-names>Yaroslav Vadimovich</given-names></name></name-alternatives><email>belyakov.yaroslav@bk.ru</email></contrib></contrib-group><pub-date pub-type="epub"><year>2026</year></pub-date><volume>11</volume><issue>3</issue><fpage>0</fpage><lpage>0</lpage><self-uri content-type="pdf" xlink:href="/media/information/2026/3/ИТ_НР_11_3_4.pdf" /><abstract xml:lang="ru"><p>The relevance of this research stems from the exponential growth of unstructured text data and the increasing demands on the speed and relevance of its processing in such applied areas as news analysis, intelligent search, and natural language processing (NLP). Existing search algorithms often face problems with low accuracy due to the morphological complexity of languages (e.g., Russian), the presence of a large number of noise words, and the need to account for semantic similarity. The goal of this study is to develop and evaluate a hybrid search algorithm that combines lexical match metrics, morphological analysis (stemming), and weighted ranking to improve the completeness and accuracy of searches in text corpora. The scientific innovation lies in the proposed multi-level relevance metric, which integrates exact match counting, word stemming analysis using optimized stemming for the Russian language, and document temporal characteristics. The methodology includes algorithm development, its software implementation, and a comparative analysis of its effectiveness on a real-world dataset, namely, news. The experiment confirmed that the hybrid approach achieves 15-20% higher accuracy than basic methods, especially when working with inflected word forms and compound queries. The study&amp;#39;s findings suggest potential for further development of the proposed approach by integrating semantic vector models and deep learning to account for the contextual proximity of concepts.</p></abstract><trans-abstract xml:lang="en"><p>The relevance of this research stems from the exponential growth of unstructured text data and the increasing demands on the speed and relevance of its processing in such applied areas as news analysis, intelligent search, and natural language processing (NLP). Existing search algorithms often face problems with low accuracy due to the morphological complexity of languages (e.g., Russian), the presence of a large number of noise words, and the need to account for semantic similarity. The goal of this study is to develop and evaluate a hybrid search algorithm that combines lexical match metrics, morphological analysis (stemming), and weighted ranking to improve the completeness and accuracy of searches in text corpora. The scientific innovation lies in the proposed multi-level relevance metric, which integrates exact match counting, word stemming analysis using optimized stemming for the Russian language, and document temporal characteristics. The methodology includes algorithm development, its software implementation, and a comparative analysis of its effectiveness on a real-world dataset, namely, news. The experiment confirmed that the hybrid approach achieves 15-20% higher accuracy than basic methods, especially when working with inflected word forms and compound queries. The study&amp;#39;s findings suggest potential for further development of the proposed approach by integrating semantic vector models and deep learning to account for the contextual proximity of concepts.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>information retrieval</kwd><kwd>stemming</kwd><kwd>morphological analysis</kwd><kwd>relevance metrics</kwd><kwd>ranking</kwd><kwd>optimization algorithm</kwd><kwd>natural language processing</kwd></kwd-group><kwd-group xml:lang="en"><kwd>information retrieval</kwd><kwd>stemming</kwd><kwd>morphological analysis</kwd><kwd>relevance metrics</kwd><kwd>ranking</kwd><kwd>optimization algorithm</kwd><kwd>natural language processing</kwd></kwd-group></article-meta></front><back><ref-list><title>Список литературы</title><ref id="B1"><mixed-citation>Vorontsov K.V. Lectures on Classification and Regression Algorithms. Moscow: MAKS Press, 2013. &amp;ndash; 215 p.</mixed-citation></ref><ref id="B2"><mixed-citation>Zhigalin A.A. Optimization of Search Algorithms in Full-Text Databases // Information Technology and Computing Systems. 2020. &amp;ndash; No. 2. &amp;ndash; P. 45-58.</mixed-citation></ref><ref id="B3"><mixed-citation>Lopulin S.A. Modern Lemmatization Methods for the Russian Language // Proceedings of the Institute for System Programming of the Russian Academy of Sciences. 2019. Vol. 31, No. 1. P. 155-170.</mixed-citation></ref><ref id="B4"><mixed-citation>Manning C. D., Raghavan P., Sch&amp;uuml;tze H. Introduction to Information Retrieval. Cambridge: Cambridge University Press, 2008. 544 p.</mixed-citation></ref><ref id="B5"><mixed-citation>Robertson S., Zaragoza H. The Probabilistic Relevance Framework: BM25 and Beyond // Foundations and Trends in Information Retrieval. 2009. Vol. 3, No. 4. P. 333-389.</mixed-citation></ref><ref id="B6"><mixed-citation>Porter M. F. An algorithm for suffix stripping // Program. 1980. Vol. 14, No. 3. P. 130-137.</mixed-citation></ref><ref id="B7"><mixed-citation>Segalovich I. A fast morphological algorithm with unknown word guessing induced by a dictionary for a web search engine // International Conference on Machine Learning. 2003. P. 273-280.</mixed-citation></ref><ref id="B8"><mixed-citation>Page L., Brin S., Motwani R., Winograd T. The PageRank Citation Ranking: Bringing Order to the Web. Stanford: Stanford InfoLab, 1999. 17 p.</mixed-citation></ref><ref id="B9"><mixed-citation>Salton G., Buckley C. Term-weighting approaches in automatic text retrieval // Information Processing and Management. 1988. Vol. 24, No. 5. P. 513-523.</mixed-citation></ref><ref id="B10"><mixed-citation>Nogueira R., Cho K. Passage Re-ranking with BERT // arXiv. 2019. URL: https://arxiv.org/pdf/1901.04085 (accessed: 07.08.2025).</mixed-citation></ref><ref id="B11"><mixed-citation>BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding / Devlin J., Chang M. W., Lee K., Toutanova K. // Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2019. Vol. 1. P. 4171-4186.</mixed-citation></ref><ref id="B12"><mixed-citation>Mitra B., Craswell N. An Introduction to Neural Information Retrieval // Foundations and Trends&amp;reg; in Information Retrieval. 2018. Vol. 13, No. 1. P. 1-126.</mixed-citation></ref><ref id="B13"><mixed-citation>Agrawal R., Srikant R. Fast algorithms for mining association rules in large databases // Proceedings of the 20th International Conference on Very Large Data Bases. 1994. P. 487-499.</mixed-citation></ref><ref id="B14"><mixed-citation>Dean J., Ghemawat S. MapReduce: Simplified data processing on large clusters // Communications of the ACM. 2008. Vol. 51, No. 1. P. 107-113.</mixed-citation></ref><ref id="B15"><mixed-citation>Buckland M., Gey F. The relationship between Recall and Precision // Journal of the American Society for Information Science. 1994. Vol. 45, No. 1. P. 12-19.</mixed-citation></ref><ref id="B16"><mixed-citation>Li X., Croft W. B. Time-based language models // Proceedings of the twelfth international conference on Information and knowledge management. 2003. P. 469-475.</mixed-citation></ref></ref-list></back></article>