Abstract
Algorithms are developed that determine canonic forms and grammar categories from individual words and the vocabulary of a text. Algorithms are proved to be highly efficient. The accuracy of determination directly depends on the length of the text.
Similar content being viewed by others
REFERENCES
A. Mikhailyan, “Some methods of automatic analysis of a natural language that are used in industrial products,” INTELTEK, Artificial Intelligence (2000), www.inteltec.ru.
W. Hahn and I. Money, “Systems of automatic abstracting,” Open systems, No. 12 (2000), www.osp.ru/os/2000/12
A. V. Sokirko, “Implementation of primary semantic analysis in the system 'Dialing',” in: Trans. Intern. Seminar Dialogue '2000 on Computer Linguistics and Its Applications, Protvino (2000).
A. M. Zemskii, S. Ye. Kryuchkov, and M. V. Svetlaev, The Russian Language [in Russian], Prosveshcheniye, Moscow (1980).
O. A. Ditel', Ukrainian Orthography [in Ukrainian], Naukova Dumka, Kyiv (2000).
A. V. Anisimov and D. E. Knuth, “Inhomogeneous sorting,” Intern. J. of Comput. and Syst. Sci., 8, No. 4, 31-39 (1979).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Anisimov, A.V., Romanik, A.N. & Taranukha, V.Y. Heuristic Algorithms for Determination of Canonical Forms and Grammatical Characteristics of Words. Cybernetics and Systems Analysis 40, 153–161 (2004). https://doi.org/10.1023/B:CASA.0000034440.41064.f4
Issue Date:
DOI: https://doi.org/10.1023/B:CASA.0000034440.41064.f4