Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zh. Vychisl. Mat. Mat. Fiz., 2006, Volume 46, Number 4, Pages 763–768 (Mi zvmmf493)  

This article is cited in 1 scientific paper (total in 1 paper)

On the solvability and regularity of comparison problems for text fragments

G. V. Nikitov

Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119991, Russia

Abstract: Within the framework of the algebraic approach to the synthesis of correct algorithms, a class of problems is studied in which the elements of the initial-information space are 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 (in a certain sense). Solvability and regularity criteria for such problems are derived. The special case of constructing monotone solutions to the problems is discussed. Criteria for the monotone solvability and monotone regularity of the problems are proved.

Key words: text comparison, algebraic approach to synthesis of correct algorithms, monotone solvability criterion, monotone regularity criterion.

Full text: PDF file (1346 kB)
References: PDF file   HTML file

English version:
Computational Mathematics and Mathematical Physics, 2006, 46:4, 726–731

Bibliographic databases:

UDC: 519.7
Received: 05.10.2005

Citation: G. V. Nikitov, “On the solvability and regularity of comparison problems for text fragments”, Zh. Vychisl. Mat. Mat. Fiz., 46:4 (2006), 763–768; Comput. Math. Math. Phys., 46:4 (2006), 726–731

Citation in format AMSBIB
\Bibitem{Nik06}
\by G.~V.~Nikitov
\paper On the solvability and regularity of comparison problems for text fragments
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2006
\vol 46
\issue 4
\pages 763--768
\mathnet{http://mi.mathnet.ru/zvmmf493}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2260362}
\zmath{https://zbmath.org/?q=an:1185.68604}
\transl
\jour Comput. Math. Math. Phys.
\yr 2006
\vol 46
\issue 4
\pages 726--731
\crossref{https://doi.org/10.1134/S0965542506040166}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-33746096129}


Linking options:
  • http://mi.mathnet.ru/eng/zvmmf493
  • http://mi.mathnet.ru/eng/zvmmf/v46/i4/p763

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. G. V. Nikitov, “On the completeness and supercompleteness of algorithmic models for comparing text fragments”, Comput. Math. Math. Phys., 49:9 (2009), 1648–1652  mathnet  crossref  zmath  isi
  • Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Number of views:
    This page:144
    Full text:90
    References:25
    First page:1

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022