Refinement of the results of recognition of mathematical formulas using the Levenshtein distance
    
    
  
  
  
      
      
      
        
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 30 (2020) no. 3, pp. 513-529
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			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.
                    
                  
                
                
                @article{VUU_2020_30_3_a10,
     author = {A. Yu. Saparov and A. P. Beltyukov and S. G. Maslov},
     title = {Refinement of the results of recognition of mathematical formulas using the {Levenshtein} distance},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {513--529},
     publisher = {mathdoc},
     volume = {30},
     number = {3},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2020_30_3_a10/}
}
                      
                      
                    TY - JOUR AU - A. Yu. Saparov AU - A. P. Beltyukov AU - S. G. Maslov TI - Refinement of the results of recognition of mathematical formulas using the Levenshtein distance JO - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki PY - 2020 SP - 513 EP - 529 VL - 30 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VUU_2020_30_3_a10/ LA - ru ID - VUU_2020_30_3_a10 ER -
%0 Journal Article %A A. Yu. Saparov %A A. P. Beltyukov %A S. G. Maslov %T Refinement of the results of recognition of mathematical formulas using the Levenshtein distance %J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki %D 2020 %P 513-529 %V 30 %N 3 %I mathdoc %U http://geodesic.mathdoc.fr/item/VUU_2020_30_3_a10/ %G ru %F VUU_2020_30_3_a10
A. Yu. Saparov; A. P. Beltyukov; S. G. Maslov. Refinement of the results of recognition of mathematical formulas using the Levenshtein distance. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 30 (2020) no. 3, pp. 513-529. http://geodesic.mathdoc.fr/item/VUU_2020_30_3_a10/
