Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
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



Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki:
Year:
Volume:
Issue:
Page:
Find






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


Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2020, Volume 30, Issue 3, Pages 513–529
DOI: https://doi.org/10.35634/vm200311
(Mi vuu739)
 

COMPUTER SCIENCE

Refinement of the results of recognition of mathematical formulas using the Levenshtein distance

A. Yu. Saparov, A. P. Beltyukov, S. G. Maslov

Udmurt State University, ul. Universitetskaya, 1, Izhevsk, 426034, Russia
References:
Abstract: The article deals with the problem of recognizing scanned mathematical texts with repeating formulas or formulas with same fragments. A method for comparing recognition results is described, which allows one to select similar elements from a variety of recognition options. The method is based on calculating the Levenshtein distances between individual fragments with additional parameters. The proposed method differs from the usual method in that, in the presence of uncertainties in comparison, all possible recognition options are used, presented as a symbol-weight pair. In the case of nonlinear formulas, numerical parameters that specify the location of individual symbols on the plane are also used in comparison. This comparison will allow you to group the formulas, and the data obtained will be useful in making decisions both by a user and by a program. Using this method will simplify the process of manual error correction, which will be based on the dynamic management of intermediate results in the process of close man-machine interaction.
Keywords: Levenshtein distance, replacement weight, displacement weight, variety of recognition options, formulas with common fragments.
Received: 12.03.2020
Bibliographic databases:
Document Type: Article
UDC: 004.93, 510.5
MSC: 68T10, 68W32
Language: Russian
Citation: A. Yu. Saparov, A. P. Beltyukov, S. G. Maslov, “Refinement of the results of recognition of mathematical formulas using the Levenshtein distance”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 30:3 (2020), 513–529
Citation in format AMSBIB
\Bibitem{SapBelMas20}
\by A.~Yu.~Saparov, A.~P.~Beltyukov, S.~G.~Maslov
\paper Refinement of the results of recognition of mathematical formulas using the Levenshtein distance
\jour Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki
\yr 2020
\vol 30
\issue 3
\pages 513--529
\mathnet{http://mi.mathnet.ru/vuu739}
\crossref{https://doi.org/10.35634/vm200311}
Linking options:
  • https://www.mathnet.ru/eng/vuu739
  • https://www.mathnet.ru/eng/vuu/v30/i3/p513
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Вестник Удмуртского университета. Математика. Механика. Компьютерные науки
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024