• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology


Indian Journal of Science and Technology

Year: 2022, Volume: 15, Issue: 27, Pages: 1336-1343

Original Article

Classification and Recognition of Bilingual Text Using Graph Edit Distance Based Degree of Similarity

Received Date:23 December 2021, Accepted Date:22 February 2022, Published Date:14 July 2022


Objectives: Graph Edit distance-based classification and recognition method is introduced in this study for bilingual characters. Specifically, this method aims to classify characters first and then recognize them in the 2nd level. Methods: This study combines both exact graph matching and inexact graph matching techniques to achieve better Recognition. The exact graph matching technique classifies characters by considering the number of vertices and edges as features to classify. Inexact graph matching uses an algorithmic model to measure the degree of similarity in the length of edit operations. Findings: The proposed model can compute, if not optimal, sequences all the time, at least near-optimal edit sequence. The proposed model is based on dynamic programming. Edit distance is estimated by comparing preorder sequences of the respective binary trees. Finally, this model uses the loss function to recognize text accurately. To bring out the practicality of the proposed model, we present a case study on the classification of English alphabets and Kannada conjunct consonants. Novelty: (i) A hybrid approach for converting a large class classification problem into a small classification problem that takes advantage of both exact and inexact graph matching techniques. (ii) An algorithmic model is designed to represent each character as a unique string. (iii) Uses dynamic programming in the right places to get the optimal tree, and (iv) to convert the graph matching problem to a string matching problem reduces the time complexity of the problem.

Keywords: Bilingual text; Character Recognition; Degree of Similarity; Graph Edit Distance; Graph Matching


  1. Adel D, Ibrahim C, Saïd Y. Efficient approximate approach for graph edit distance problemPattern Recognition Letters (IF3.756)2021;151:310316. Available from: https://doi.org/10.1007/s10618-020-00733-5
  2. Ma G, Ahmed NK, Willke TL, Yu PS. Deep graph similarity learning: a surveyData Mining and Knowledge Discovery2021;35(3):688725. Available from: https://doi.org/10.1109/ACCESS.2020.2993191
  3. Ok S. A graph similarity for deep learningAdvances in Neural Information Processing Systems, 2020-December(NeurIPS2020. Available from: https:// papers.nips.cc/paper/2020/file/0004d0b59e19461ff126e3a08a814c33-Paper.pdf
  4. Raveaux R. On the unification of the graph edit distance and graph matching problemsPattern Recognition Letters2021;145:240246. Available from: https://doi.org/10.1016/j.patrec.2021.02.014
  5. Serratosa F. Redefining the Graph Edit DistanceSN Computer Science2021;2(6):18. Available from: https://doi.org/10.1007/s42979-021-00792-5
  6. Rica E, Álvarez S, Serratosa F. Ligand-Based Virtual Screening Based on the Graph Edit DistanceInternational Journal of Molecular Sciences2021;22(23):12751. Available from: https://doi.org/10.3390/ijms222312751
  7. Marcelli A, Quer S, Squillero G. The Maximum Common Subgraph problem: A portfolio approach. 2019. Available from: https://arxiv.org/pdf/1908.06418.pdf
  8. Harsh P, Purvi P. Study and Analysis of Decision Tree Based Classification AlgorithmsInternational Journal of Computer Sciences and Engineering2018;6(10):7478. Available from: https://doi.org/10.26438/ijcse/v6i10.7478
  9. Jiang Z, Wang T, Yan J. Unifying Offline and Online Multi-Graph Matching via Finding Shortest Paths on SupergraphIEEE Transactions on Pattern Analysis and Machine Intelligence2021;43(10):36483663. Available from: https://doi.org/10.1109/TPAMI.2020.2989928
  10. Kumar V, Ramakrishnan B, AG. Machine recognition of printed Kannada textLecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics2002;p. 3748. Available from: https://doi.org/10.1007/3-540-45869-7_4
  11. Hazra A, Choudhary P, Inunganbi S, Adhikari M. Bangla-Meitei Mayek scripts handwritten character recognition using Convolutional Neural NetworkApplied Intelligence2021;51(4):22912311. Available from: https://doi.org/10.1007/s10489-020-01901-2
  12. Chen Z, Xie Z, Yan J, Zheng Y, Yang X. Layered Neighborhood Expansion for Incremental Multiple Graph MatchingComputer Vision – ECCV 20202020;p. 251267. Available from: https://doi.org/10.1007/978-3-030-58607-2_15
  13. Bhagwat G, Kumari S, Patekar V, Deaconu AM. Novel Static Multi-Layer Forest Approach and Its ApplicationsMathematics2021;9(21):2650. Available from: https://doi.org/10.3390/math9212650
  14. Sann SS, Win SS, Thant ZM. An analysis of various Image Pre-Processing techniques in Butterfly ImageInternational Journal of Advance Research2021;6(1).
  15. Dey R, Balabantaray RC, Mohanty S. Sliding window based off-line handwritten text recognition using edit distanceMultimedia Tools and Applications2021. Available from: https://doi.org/10.1007/s11042-021-10988-9


© 2022 Roopa & Mahantesh. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Published By Indian Society for Education and Environment (iSee)


Subscribe now for latest articles and news.