title: Finding the presence of borrowings in scientific works based on Markov chains
metadata.name: dc.contributor.author
metadata.value: Saakyan, Rustam R.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Shpekht, Irina A.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Petrosyan, Gevorg A.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2023-06-13T16:31:04Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2023-06-13T16:31:04Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2023-03
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Saakyan R. R., Shpekht I., A., Petrosyan G. A. Finding the presence of borrowings in scientific works based on Markov chains. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2023, vol. 19, iss. 1, pp. 43–50.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2023.104
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/41573
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The study aims to develop optimal approaches to the search for borrowings in scientific works. The article discusses the stages of searching for the presence of borrowings, such as preprocessing, rough filtering of texts, searching for similar texts, and searching for borrowings. The main focus is on the description of approaches and techniques that can be effectively implemented at each stage. For example, for the preprocessing stage, it may be converting text characters from uppercase to lowercase, removing punctuation marks, and removing stop words. For the stage of rough text filtering, it is filters by topic and word frequency. It may be calculating the importance of words in the context of the text and representing the word as a vector in multidimensional space to determine the proximity measure for the stage of finding similar texts. Finally, it is a search for an exact match, paraphrases and a measure of similarity of expressions for the stage of finding borrowings. The scientific novelty lies in using Markov chains to find the similarity of texts for the second and third stages of the search for borrowings proposed by authors. As a result, the example shows the technique of using Markov chains for text representation, searching for the most frequently occurring words, building a graph of a Markov chain of words, and the prospects for using Markov chains of texts for rough filtering and searching for similar texts.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 19; Issue 1
metadata.lang: -
metadata.name: dc.subject
metadata.value: search for borrowings
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: algorithms for finding borrowings
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: Markov chains
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: originality checker software
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Finding the presence of borrowings in scientific works based on Markov chains
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 16085-Текст статьи-54683-1-10-20230527.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/41573/1/16085-%d0%a2%d0%b5%d0%ba%d1%81%d1%82%20%d1%81%d1%82%d0%b0%d1%82%d1%8c%d0%b8-54683-1-10-20230527.pdf
resources.format: Adobe PDF
resources.size: 382,94 kB