Enhancing Typo-Tolerant Data Retrieval in the Andeng Village PKK Information System Using the Damerau-Levenshtein Distance Algorithm

Vollständiger Abstract

Worum geht es in dieser Arbeit?

Data search is an essential feature in information systems that enables users to retrieve required information efficiently and accurately. However, the data search process in the Andeng Village Family Welfare Movement (PKK) Activity Management Information System is still limited because users must enter search queries that exactly match the stored data. Consequently, the system fails to retrieve relevant information when typographical errors (typos) occur in search queries. This study aims to improve the effectiveness of data retrieval by implementing the Damerau-Levenshtein Distance algorithm to support typo-tolerant searching, allowing the system to retrieve relevant data despite variations in user input. The algorithm was implemented by measuring the similarity between user queries and stored data using four edit operations, namely insertion, deletion, substitution, and transposition. The evaluation was conducted using 50 typo-containing search queries representing various typo patterns in PKK activity data, and the performance was measured based on retrieval accuracy and processing time. The results show that the implemented algorithm successfully retrieved relevant data despite typing errors in search queries. The testing achieved 100% accuracy on the tested PKK search scenarios with an average search processing time of 65.11 ms or 0.06511 seconds. These findings indicate that the Damerau-Levenshtein Distance algorithm provides effective and efficient performance for improving typo-tolerant data searching in the Andeng Village Family Welfare Movement (PKK) Activity Management Information System.