Matching of hand-drawn flowchart, pseudocode, and english description using transfer learning

被引:0
作者
Sagarika Ghosh
Sanjoy Pratihar
Sanjay Chatterji
Anupam Basu
机构
[1] Indian Institute of Information Technology Kalyani,Computer Science & Engineering
[2] University of Engineering & Management Jaipur,Computer Science & Engineering
[3] National Institute of Technology Durgapur,Computer Science & Engineering
来源
Multimedia Tools and Applications | 2023年 / 82卷
关键词
Hand-drawn flowchart; Pseudocode; Text description; S-DistilBERT; Ruleset; Embedding; Transfer learning; Similarity matching;
D O I
暂无
中图分类号
学科分类号
摘要
An algorithm plays an important role when solving a problem. It is challenging to comprehend for computer novices or machines. Therefore, a textual explanation is provided to illustrate the algorithm. To understand an algorithm, a method needs to be devised to find or generate the corresponding text description and vice versa. This paper matches an algorithm in a variety of forms, such as pseudocode and hand-drawn flowchart, with the illustrative text written in English to facilitate a thorough understanding of the algorithm. The experiment includes a proposed set of rules for generating pseudocode from a hand-drawn flowchart and a proposed S-DistilBERT-based transfer learning method to determine the similarity match score between multiple forms of algorithm and text description. Basic block and line identification, as well as OCR-ization, are used to characterize the hand-drawn flowcharts. The experimental result show that we can generate the equivalent pseudocode in 85% cases, and our fine-tuned S-DistilBERT model can accommodate the matching text for the existing pseudocode with 75.59% and the generated pseudocode with 74.57% accuracy. We also find the appropriate description from an algorithm in the top five matches in 30 out of 50 cases. The rules are found to be adequate for non-recursive flowcharts.
引用
收藏
页码:27027 / 27055
页数:28
相关论文
共 36 条
[1]  
Alzubi J(2020)Paraphrase identification using collaborative adversarial networks J Intell Fuzzy Syst: Appl Eng Technol 39 1021-1032
[2]  
Jain R(2007)Fast polygonal approximation of digital curves using relaxed straightness properties IEEE Trans Pattern Anal Mach Intell 29 1590-1602
[3]  
Kathuria A(2008)Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria J Visual Comun Image Represent 19 219-230
[4]  
Khandelwal A(2003)Local lines: a linear time line detector Pattern Recogn Lett 24 2291-2300
[5]  
Saxena A(1986)Optimum uniform piecewise linear approximation of planar curves IEEE Trans Patt-Anal Mach Intell 8 67-75
[6]  
Singh A(2008)A unified curvature definition for regular, polygonal, and digital planar curves Int J Comput Vis 80 104-124
[7]  
Bhowmick P(2008)Dominant point detection by reverse polygonization of digital curves Image Vis Comput 26 702-715
[8]  
Bhattacharya BB(2002)Extraction of dominant points by estimation of the contour fluctuations Pattern Recogn 35 1447-1462
[9]  
Chung KL(1992): an algorithm for detection of dominant points and polygonal approximation of digitized curves Pattern Recogn Lett 13 849-856
[10]  
Liao PH(2000)äinen, adaptive document image binarization Pattern Recogn 33 225-236