Determinate Identification of Russian Text Letter Bigrams
Keywords:
identification, character, bigram, the Russian language, one-to-one substitutionAbstract
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 shownReferences
Published
2016-02-15
How to Cite
Kotov, Y. (2016). Determinate Identification of Russian Text Letter Bigrams. SPIIRAS Proceedings, 1(44), 181-197. https://doi.org/10.15622/sp.44.11
Section
Theoretical and Applied Mathematics
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
