Implementation of Rabin Karp Algorithm for Essay Writing Test System on Organization xyz

Every year the xyz organization conducts written tests for participants who will be administrators of the xyz organization, written tests are chosen because participants can convey information verbally. But it is constrained for correction, because to correct essay answers manually will require a lot of time, while the answers from participants 1 and other participants are different. By kaera the written test system owned by the xyz organization needs to be developed to facilitate correction of participants' answers to the system, so that the assessment process can be done easily and quickly. To correct answers quickly and accurately, a system is needed that can correct the answers to essays by applying the Rabin Karp algorithm. Rabin Karp is a very efficient multiple pattern search algorithm that searches for many pattern sets using the hash method in searching for words. The results of this system are expected to improve the answers to essay questions more easily and accurately. This theory is rarely used to find one word, but it is very important and very effective when used to look for several patterns. For this reason, in this study Rabin Karp's ability to detect similarities in the similarity of the participants' answers to the system will be proven by giving a similarity to the sentence or word. The process of equating sentences or words through preprocessing stages, so that the data becomes "clean", so it is feasible to do the hashing process. After hashing, the Rabin Karp algorithm is applied for each word and its similarity measurement uses the dice coefficient, which results in the same sentence value from the participant's answer and the system. The better the stemming process in the preprocessing process, the higher the value of the similarity.