|
Tr. SPIIRAN, 2016, Issue 44, Pages 181–197
(Mi trspy861)
|
|
|
|
Theoretical and Applied Mathematics
Determinate Identification of Russian Text Letter Bigrams
Yu. A. Kotov Novosibirsk State Technical University (NSTU)
Abstract:
A problem of symbols identification of natural language texts on numerical charac-teristics of these texts is considered. The proposed solution for the Russian texts is based on the language rules and bigram frequency. The solution is a system of identifying functions for each character of the alphabet and a deterministic sequence of their application. The limitations, efficiency and extension options of the proposed solution are shown.
Keywords:
identification; character; bigram; the Russian language; one-to-one substitution.
DOI:
https://doi.org/10.15622/sp.44.11
Full text:
PDF file (1029 kB)
UDC:
519.6
Citation:
Yu. A. Kotov, “Determinate Identification of Russian Text Letter Bigrams”, Tr. SPIIRAN, 44 (2016), 181–197
Citation in format AMSBIB
\Bibitem{Kot16}
\by Yu.~A.~Kotov
\paper Determinate Identification of Russian Text Letter Bigrams
\jour Tr. SPIIRAN
\yr 2016
\vol 44
\pages 181--197
\mathnet{http://mi.mathnet.ru/trspy861}
\crossref{https://doi.org/10.15622/sp.44.11}
\elib{https://elibrary.ru/item.asp?id=25616425}
Linking options:
http://mi.mathnet.ru/eng/trspy861 http://mi.mathnet.ru/eng/trspy/v44/p181
Citing articles on Google Scholar:
Russian citations,
English citations
Related articles on Google Scholar:
Russian articles,
English articles
|
Number of views: |
This page: | 126 | Full text: | 67 |
|