Correcting a lot of data and irregular if we do manually is an activities that waste time today. PMB committee also experience it at their working environment. Because of that we need a system that able to correct without having done manually. Basically, correct the data and the text is to do the matching. Algorithms which use in this thesis is the Rabin-Karp. This algorithm is used because it is suitable for a search pattern like in the case experienced by the committee of PMB STT-PLN Jakarta. After a series of tests and also comparison, Rabin-Karp algorithm has a better processing time (running time) than the other algorithms