|
This article is cited in 1 scientific paper (total in 1 paper)
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.
Citation:
Yu. A. Kotov, “Determinate Identification of Russian Text Letter Bigrams”, Tr. SPIIRAN, 44 (2016), 181–197
Linking options:
https://www.mathnet.ru/eng/trspy861 https://www.mathnet.ru/eng/trspy/v44/p181
|
Statistics & downloads: |
Abstract page: | 205 | Full-text PDF : | 152 |
|