Sistem Informasi Pengarsipan Menggunakan Algoritma Levensthein String pada Kecamatan Seberang Ulu II

TL;DR

This paper presents an archival information system for government agencies that utilizes the Levenshtein string algorithm to improve search accuracy and reduce user errors in document retrieval.

Contribution

It introduces the application of the Levenshtein distance algorithm for approximate string matching in a government archival system, enhancing search functionality.

Findings

Improved search accuracy with Levenshtein algorithm

Reduced user errors in document retrieval

Enhanced document management efficiency

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.