Calculating the Number of Occurrences Word using Knuth Morris Pratt Algorithm

Budiana, Richard Marchiano (2016) Calculating the Number of Occurrences Word using Knuth Morris Pratt Algorithm. Other thesis, Fakultas Ilmu Komputer UNIKA Soegijapranata.

Preview	Text (COVER) 12.02.0028 Richard Marchiano Budiana COVER.pdf Download (1MB) | Preview
	Text (BAB I) 12.02.0028 Richard Marchiano Budiana BAB I.pdf Restricted to Registered users only Download (1MB)
	Text (BAB II) 12.02.0028 Richard Marchiano Budiana BAB II.pdf Restricted to Registered users only Download (1MB)
	Text (BAB III) 12.02.0028 Richard Marchiano Budiana BAB III.pdf Restricted to Registered users only Download (1MB)
	Text (BAB IV) 12.02.0028 Richard Marchiano Budiana BAB IV.pdf Restricted to Registered users only Download (1MB)
	Text (BAB V) 12.02.0028 Richard Marchiano Budiana BAB V.pdf Restricted to Registered users only Download (1MB)
	Text (BAB VI) 12.02.0028 Richard Marchiano Budiana BAB VI.pdf Restricted to Registered users only Download (1MB)
Preview	Text (DAFTAR PUSTAKA) 12.02.0028 Richard Marchiano Budiana DAFTAR PUSTAKA.pdf Download (1MB) | Preview

Abstract

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

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions:	Faculty of Computer Science > Department of Informatics Engineering
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	31 May 2016 06:23
Last Modified:	19 Aug 2022 06:27
URI:	http://repository.unika.ac.id/id/eprint/9717

Actions (login required)

View Item