Al Birr Karim Susanto
Teknik Informatika, Universitas Dian Nuswantoro

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Comparison of String Similarity Algorithm in post-processing OCR Al Birr Karim Susanto; Nuraziz Muliadi; Bagus Nugroho; Muljono Muljono
Journal of Applied Intelligent System Vol 8, No 1 (2023): Journal of Applied Intelligent System
Publisher : Universitas Dian Nuswantoro and IndoCEISS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33633/jais.v8i1.7079

Abstract

The Optical Character Recognition (OCR) problem that often occurs is that the image used, has a lot of noise covering letters in a word partially. This can cause misspellings in the process of word recognition or detection in the image. After the OCR process, we must do some post-processing for correcting the word. The words will be corrected using a string similarity algorithm. So what is the best algorithm? We conducted a comparison algorithm including the Levenshtein distance, Hamming distance, Jaro-Winkler, and Sørensen – Dice coefficient. After testing, the most effective algorithm is the Sørensen-Dice coefficient with a value of 0.88 for the value of precision, recall, and F1 score