Calculating the Number of Occurrences Word using Knuth Morris Pratt Algorithm
Daftar Isi:
- Abstract — the office secretary who works primarily creating reports, books, or any type of work activity long text, the number of occurrences of words and sentence containing the word are very important. because if there may be a mistake or a typo in the said report that requires replacing all the same word overall , it will take a long time to check manually. One algorithm that can solve this problem is the Knuth- Morris-Pratt algorithm. This project was made using the Java programming language and the algorithm using Knuth-Morris-Pratt algorithm. How it works is at first the Knuth-Morris-Pratt algorithm to start by looking for words that appear in the text and no word pattern same , then the word will count each weight of letters. weight will be used in the process of matching words with text patterns. In this project the weight of each word is different, depending similarity of the letters of the word. The shift during the matching process depends on the weight of said pattern, the greater the weight in the event of a mismatch, the matching process will be quicker completion