Geodesic
On the completeness and supercompleteness of algorithmic models for comparing text fragments
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 9, pp. 1724-1728 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Within the framework of the algebraic approach to the synthesis of correct algorithms, a class of problems is studied in which the initial data consist of numerical descriptions of pairs of text fragments. Solution algorithms use these descriptions to classify the original pairs of fragments according to the degree of their similarity or dissimilarity. Solvability and regularity criteria for such problems were obtained in earlier studies. The special case of constructing monotone solutions to such problems was also studied. In this paper, criteria of the completeness and supercompleteness of algorithmic models for the class of problems under examination are proved. Criteria of the monotone completeness and supercompleteness are also considered. 
@article{ZVMMF_2009_49_9_a17,
     author = {G. V. Nikitov},
     title = {On the completeness and supercompleteness of algorithmic models for comparing text fragments},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1724--1728},
     year = {2009},
     volume = {49},
     number = {9},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_9_a17/}
}
TY  - JOUR
AU  - G. V. Nikitov
TI  - On the completeness and supercompleteness of algorithmic models for comparing text fragments
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2009
SP  - 1724
EP  - 1728
VL  - 49
IS  - 9
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_9_a17/
LA  - ru
ID  - ZVMMF_2009_49_9_a17
ER  - 
%0 Journal Article
%A G. V. Nikitov
%T On the completeness and supercompleteness of algorithmic models for comparing text fragments
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2009
%P 1724-1728
%V 49
%N 9
%U http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_9_a17/
%G ru
%F ZVMMF_2009_49_9_a17
G. V. Nikitov. On the completeness and supercompleteness of algorithmic models for comparing text fragments. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 9, pp. 1724-1728. http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_9_a17/

[1] Zhuravlev Yu. I., Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya i klassifikatsii, Probl. kibernetiki, 33, Nauka, M., 1978

[2] Zhuravlev Yu. I., Rudakov K. V., “Ob algebraicheskoi korrektsii protsedur obrabotki (preobrazovaniya) informatsii”, Probl. prikl. matem. i informatiki, Nauka, M., 1987, 187–198 | MR

[3] Rudakov K. V., “Universalnye i lokalnye ogranicheniya v probleme korrektsii evristicheskikh algoritmov klassifikatsii”, Kibernetika, 1987, no. 2, 30–35 | MR

[4] Rudakov K. V., “Postroenie problemno-orientirovannykh teorii na osnove algebraicheskogo podkhoda k zadacham raspoznavaniya obrazov”, Dokl. konf. MMRO-10, M., 2001, 113–115

[5] Nikitov G. V., “O razreshimosti i regulyarnosti zadach sravneniya tekstovykh fragmentov”, Zh. vychisl. matem. i matem. fiz., 46:4 (2006), 763–768 | MR | Zbl