• Register
  • Login

International Research Journal on Advanced Science Hub

  1. Home
  2. Analyzing and Experimenting Open Source OCR Engines in RPA with Levenshtein Distance Algorithm

Current Issue

By Issue

By Author

Author Index

Keyword Index

About Journal

News

Aims and Scope

Editorial Board

Publication Ethics

Indexing and Abstracting

Related Links

FAQ

Peer Review Process

Journal Metrics

Advertising policy

Editor and Reviewer guidelines

Digital Archiving & Preservation Policy

Copyright Terms

Licensing Terms

Editorial Process - Peer Reviewed

Analyzing and Experimenting Open Source OCR Engines in RPA with Levenshtein Distance Algorithm

    Authors

    • Malathi T 1
    • Diwaan Chandar C S 2
    • Nithish S 2
    • Niranjan V 3
    • Swashthika A K 3

    1 Department of Computer Science & Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, Tamilnadu - 638401

    2 Department of Information Science & Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, Tamilnadu - 638401

    3 Department of Computer Technology, Bannari Amman Institute of Technology, Sathyamangalam, Erode, Tamilnadu - 638401

,

Document Type : Review Article

10.47392/irjash.2020.269
  • Article Information
  • Download
  • Export Citation
  • Statistics
  • Share

Abstract

Robotic Process Automation is a platform used to automate boring and repetitive computer processes using software bots so that humans could involve in tasks which include creativity and decision making which could not be done by robots. Optical Character Recognition takes out printed characters in an image and converts it to text. Google Tesseract OCR and Microsoft OCR were the commonly used OCR engines available in UiPath, a tool for Robotic Process Automation. In Previous, research on comparing those two open source OCR engine, there we made comparison on basic factors which included speed, hardware requirements, accuracy ,but in that case, accuracy was been calculated manually which gave us results but with less precise, as it was a manual process to substitute scraped data to that formulas, In this research we’ve made results with more precision by performing a String comparison algorithm named, “Levenshtein Distance Algorithm” which is deployed in UiPath.

Keywords

  • Optical Character Recognition(OCR)
  • Robotics Process Automation(RPA)
  • Google Tesseract OCR
  • Microsoft OCR
  • XML
  • PDF 267.9 K
  • RIS
  • EndNote
  • Mendeley
  • BibTeX
  • APA
  • MLA
  • HARVARD
  • CHICAGO
  • VANCOUVER
    • Article View: 579
    • PDF Download: 601
International Research Journal on Advanced Science Hub
Volume 02, Special Issue ICSTM 12S - Issue Serial Number 12
December 2020
Page 98-104
Files
  • XML
  • PDF 267.9 K
History
  • Receive Date: 05 December 2020
  • Revise Date: 18 December 2020
  • Accept Date: 23 December 2020
Share
Export Citation
  • RIS
  • EndNote
  • Mendeley
  • BibTeX
  • APA
  • MLA
  • HARVARD
  • CHICAGO
  • VANCOUVER
Statistics
  • Article View: 579
  • PDF Download: 601

APA

T, M. , C S, D. C. , S, N. , V, N. and A K, S. (2020). Analyzing and Experimenting Open Source OCR Engines in RPA with Levenshtein Distance Algorithm. International Research Journal on Advanced Science Hub, 02(Special Issue ICSTM 12S), 98-104. doi: 10.47392/irjash.2020.269

MLA

T, M. , , C S, D. C. , , S, N. , , V, N. , and A K, S. . "Analyzing and Experimenting Open Source OCR Engines in RPA with Levenshtein Distance Algorithm", International Research Journal on Advanced Science Hub, 02, Special Issue ICSTM 12S, 2020, 98-104. doi: 10.47392/irjash.2020.269

HARVARD

T, M., C S, D. C., S, N., V, N., A K, S. (2020). 'Analyzing and Experimenting Open Source OCR Engines in RPA with Levenshtein Distance Algorithm', International Research Journal on Advanced Science Hub, 02(Special Issue ICSTM 12S), pp. 98-104. doi: 10.47392/irjash.2020.269

CHICAGO

M. T , D. C. C S , N. S , N. V and S. A K, "Analyzing and Experimenting Open Source OCR Engines in RPA with Levenshtein Distance Algorithm," International Research Journal on Advanced Science Hub, 02 Special Issue ICSTM 12S (2020): 98-104, doi: 10.47392/irjash.2020.269

VANCOUVER

T, M., C S, D. C., S, N., V, N., A K, S. Analyzing and Experimenting Open Source OCR Engines in RPA with Levenshtein Distance Algorithm. International Research Journal on Advanced Science Hub, 2020; 02(Special Issue ICSTM 12S): 98-104. doi: 10.47392/irjash.2020.269

  • Home
  • About Journal
  • Editorial Board
  • Submit Manuscript
  • Contact Us
  • Sitemap

News

  • Career at RSP SCIENCE HUB 2024-05-03

Newsletter Subscription

Subscribe to the journal newsletter and receive the latest news and updates

© Journal Management System. Powered by iJournalPro.com