Penerapan E-Service Berbasis Android pada Divisi Pelayanan Perbaikan Komputer CV Ria Kencana Ungu (RKU)

TL;DR

This paper presents an Android-based e-service application for computer repair services at CV Ria Kencana Ungu, utilizing Levenshtein distance to improve search accuracy in document management systems.

Contribution

It introduces a search suggestion feature using Levenshtein distance to reduce user errors in document searches within government archival systems.

Findings

Improved search accuracy with Levenshtein distance implementation

Enhanced document management efficiency

Reduced user errors in search queries

Abstract

Archival information systems in government agency is one of the most used applications for daily acitivities. One feature in application management information document is searching. This feature serves to search for documents from a collection of available information based on keywords entered by the user. But some researches on a search engine (searching) concluded that the average user error in the search is quite high due to several factors. Therefore, we need a development on this feature as search suggestion. This study discusses the application of the method of approximate string matching algorithm using levenshtein distance. Levensthein distance algorithm is capable of calculating the minimum distance conversion of a string into another string to the optimum. Archiving information system using Levensthein Algorithm String is an application that will be built to address these problems, this application will help, especially in the administration to enter or save a document, locate and make a report that will be seen by government agencies.