This research aims to (1) Know the results of the performance comparison between string matching algorithms between LsHashq, Booyer-Moore Horspool (BMH) and Knuth-Morris-Pratt (KMP) on the internal information system of PPC Cileungsi branch of PDAM Tirta Kahuripan Bogor Regency in the case study of matching customer complaint data. (2) To find out which string matching algorithm is suitable and appropriate to be applied to the PPC internal filing information system at the Cileungsi branch of PDAM Tirta Kahuripan office in the case study of customer complaint data matching. This research is a quantitative descriptive research with a case study approach. Data was taken from secondary data related to customer complaints for the last 2 years using Disproportionate random sampling method. The string matching algorithm was tested using confusion matrix to assess accuracy, recall, and precision, as well as memory consumption and execution time. The results show that the hash-based string matching algorithm (LsHashq) has an overall average MPE value of 74.62%. The character-based string matching algorithm (BMH) has an overall average MPE value of 75.35%. The KMP algorithm has an overall average MPE value of 76.06%. Therefore, the LsHashq algorithm is recommended because it has superior performance compared to other algorithms.
