Sistem Informasi Pengarsipan Berbasis Web Mengunakan Algoritma Levenshtein Distance
DOI:
https://doi.org/10.58776/jriti.v3i2.225Kata Kunci:
Archiving Information System, Levenshtein Distance Algorithm, Document Management, Document SearchAbstrak
This study proposes the development of a web-based archiving information system at PMI Jakarta City, supported by the Levenshtein Distance algorithm as the core feature for document retrieval. The system is designed to overcome the limitations of manual archiving methods, such as restricted search capabilities, potential recording errors, and the risk of losing physical records. By adopting the Waterfall approach, the research was conducted through several stages: requirements analysis, interface design, implementation, and system testing. The results demonstrate that the Levenshtein Distance algorithm effectively improves the accuracy of document searches, even when spelling variations or typographical errors occur in the query. This makes the system more adaptive and efficient compared to traditional manual methods. Furthermore, the implementation of a web-based system reduces reliance on physical archives, enhances storage security, and accelerates information access. Overall, the developed system provides a practical and modern solution to support document management at PMI Jakarta City.
Referensi
A. Noeman, D. R. Fauzi, D. Hartanti, A. Hiswara, and P. Kustanto, “Employee Work Schedule Presence System Application Design at PT . Tasya Putry Mandiri Uses Genetic Algorithm Method,” vol. 2, no. 2, pp. 51–54, 2024.
R. Gusdiana, I. Alfian, and C. Juliane, “Implementation of Text Processing for Sentiment Analysis of Tax Payment Interest After the ‘Rubicon’ Phenomenon,” J. Tek. Inform., vol. 4, no. 5, pp. 1157–1164, 2023, doi: 10.52436/1.jutif.2023.4.5.1014.
M. Haris and A. Farisi, “K-Means Algorithm and Levenshtein Distance Algorithm For Sentiment Analysis of School Zonation System Policy,” no. November, 2021, doi: 10.1109/ICIC54025.2021.9632943.
M. L. Ishimora and S. Rejeki, “Web-Based Mail Search Using the Levenshtein Distance Algorithm,” vol. 10, no. 225, pp. 143–156, 2026.
H. T. Sadiah, M. Saad, N. Ishlah, and N. N. Rokhmah, “Query Suggestion on Drugs e-Dictionary Using the Levenshtein Distance Algorithm,” vol. 10, no. 3, pp. 193–202, 2019.
H. Schwarz, W. Weber, I. Minderop, and B. Weiß, “In Search of the Best Response Scale in a Mixed-mode Survey (Web and Mail). Evidence from MTMM Experiments in the GESIS Panel,” Methods, Data, Anal., vol. 15, no. 2, pp. 161–190, 2021, doi: 10.12758/mda.2021.05.
I. D. Wijaya, E. Irawan, and A. N. Rahmanto, “Rancang Bangun Pembuatan Sitem Informasi Manajemen Dokumen E-Arsip PT.PLN (Persero) Unit Induk Pembangkitan Sumatera Bagian Selatan,” J. Teknol. Dan Sist. Inf. Bisnis, vol. 5, no. 4, pp. 468–475, 2023, doi: 10.47233/jteksis.v5i4.939.
F. W. Arsyta and R. E. Putra, “Penerapan Algoritma Damerau Levenshtein Distance Pada Pencarian Arsip Desa Jerukseger Pendukung ISO,” J. Informatics Comput. Sci., vol. 4, no. 4, pp. 423–435, 2023.
P. Zidni and A. Iskandar, “Perbandingan Algoritma Ratcliff/Obershelp Dan Levenshtein Distance Dalam Chatbot Aiml Untuk Universitas Xyz,” J. Comput. Sci. Inf. Technol., vol. 2, no. 2, pp. 227–240, 2025, doi: 10.70248/jcsit.v2i2.2041.
Z. Zhang and M. Gerstein, “Patterns of nucleotide substitution, insertion and deletion in the human genome inferred from pseudogenes,” Nucleic Acids Res., vol. 31, no. 18, pp. 5338–5348, 2003, doi: 10.1093/nar/gkg745.
Y. H. Agustin, Y. Septiana, and A. Y. Aspahany, “Search Optimization of PIP Scholarship Recipients In Web-Based Student Data Application Using The Levenshtein Distance Algorithm,” vol. 7, no. 4, pp. 2069–2081, 2023.
Unduhan
Diterbitkan
Cara Mengutip
Terbitan
Bagian
Lisensi
Hak Cipta (c) 2025 achmad noeman, Agus Hidayat, Arif R. Dwiyanto, Mohammad Hoki Rezky
Artikel ini berlisensiCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
