Knuth-Morris-Pratt Research Articles

Analysis and Comparison of Full-Text Search Algorithms

The exponential growth of electronically stored textual data poses a significant challenge for search engine developers. This paper is dedicated to a detailed study and comparison of three classical full-text search algorithms: Knuth-Morris-Pratt (KMP), Boyer-Moore (BM), and Rabin-Karp (RK). These algorithms are widely used in computer science for efficient substring searching in textual data. The research results allowed us to identify the strengths and weaknesses of each algorithm and to determine the conditions under which each algorithm is most efficient.

Utilization chatbot for Indonesian tourism: a post-pandemic solution of information accessibility

Indonesia is a renowned tourist destination worldwide. However, the COVID-19 pandemic has resulted in a decrease in both foreign and domestic tourist visits. Therefore, this research aims to develop a Telegram-based ChatBot application to increase post-pandemic tourist visits. The ChatBot is designed to make it easier for tourists to obtain information related to transportation and accommodation at tourist attractions. The ChatBot is built using the Knuth-Morris-Pratt (KMP) algorithm and web scraping method. The ChatBot's response to the keyword matching is then presented to tourists. To measure travelers' perceptions of ChatBot, the System Usability Scale (SUS) was used. SUS is a questionnaire consisting of 10 questions that were answered by 20 anonymous users. Based on the calculations, the average SUS score is 71, which indicates that the developed ChatBot is in the good category and suitable for use. Using this ChatBot will make it easier for tourists to obtain tourism information in Indonesia. With its ability to retrieve relevant information related to transportation and accommodation at tourist attractions, the ChatBot can serve as a useful tool to increase post-pandemic tourist visits.

On the Practical Power of Automata in Pattern Matching

Many papers in the intersection of theoretical and applied algorithms show that the simple, asymptotically less efficient algorithm, performs better than the bestcomplex theoretical algorithms on random data or in specialized “real world” applications. This paper considers the Knuth–Morris–Pratt automaton, and shows a counter-intuitive practical result. The classical pattern matching paradigm is that of seeking occurrences of one string—the pattern, in another—the text, where both strings are drawn from an alphabet set Σ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Sigma$$\\end{document}. Assuming the text length is n and the pattern length is m, this problem can naively be solved in time O(nm). In Knuth, Morris and Pratt’s seminal paper of 1977, an automaton, was developed that allows solving this problem in time O(n) for any alphabet. This automaton, which we will refer to as the KMP-automaton, has proven useful in solving many other problems. A notable example is the parameterized pattern matching model. In this model, a consistent renaming of symbols from Σ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Sigma$$\\end{document} is allowed in a match. The parameterized matching paradigm has proven useful in problems in software engineering, computer vision, and other applications. It has long been believed that for texts where the symbols are uniformly random, the naive algorithm will perform as well as the KMP algorithm. In this paper, we examine the practical efficiency of the KMP algorithm versus the naive algorithm on a randomly generated text. We analyze the time under various parameters, such as alphabet size, pattern length, and the distribution of pattern occurrences in the text. We do this for both the original exact matching problem and parameterized matching. While the folklore wisdom is vindicated by these findings for the exact matching case, surprisingly, the KMP algorithm always works significantly faster than the naive in the parameterized matching case. We check this hypothesis for DNA texts and image data and observe a similar behavior as in the random text. We also show a very structured exact matching case where the automaton is much more efficient.

Knuth–Morris–Pratt illustrated

Abstract The Knuth–Morris–Pratt (KMP) algorithm for string search is notoriously difficult to understand. Lost in a sea of index arithmetic, most explanations of KMP obscure its essence. This paper constructs KMP incrementally, using pictures to illustrate each step. The end result is easier to comprehend. Additionally, the derivation uses only elementary functional programming techniques.

LπCET: A Logic Security Analysis for Cryptographic Protocols Based on π‐Calculus Extension Theory

The π‐calculus is a basic theory of mobile communication based on the notion of interaction, which, is aimed at analyzing and modeling the behaviors of communication processes in communicating and mobile systems, and is widely applied to the security analysis of cryptographic protocol’s design and implementation. But the π‐calculus does not provide seamless logical security analysis, so the logical flaws in the design and the implementation of a cryptographic protocol cannot be discovered in time. This paper introduces logical rules and logical proofs, binary tree, and the KMP algorithm and proposes a new extension of the π‐calculus theory, a logical security analysis method, and an algorithm. The aim is to analyze whether there are logical flaws in the design and the implementation of a cryptographic protocol, to ensure the security of the cryptographic protocol when it is encoded into software and implemented. This paper presents the logical security proof and analysis of the TLS1.3 protocol’s interactional implementation process. Empirical results show that the additional extension theory, the logical security analysis method, and the algorithm can effectively analyze whether there are logical flaws in the design and the implementation of a cryptographic protocol.

String Matching Pada Pencarian Di Web Jurnal Menggunakan Algoritma Knuth Morris Pratt (KMP)

This research aims to: (1) enhance the responsiveness of a journal website for easier access from mobile devices and improve the quality of its appearance and user experience during web browsing, (2 enabling easy access to information and visibility, and (3) improve the data processing of the journal by effectively utilizing the Knuth Morris Pratt (KMP) algorithm. The subjects of this research are the user interface and user experience of the web journal application for students, learners, and the general public, while the object of this research is the web journal application itself. The data sources used consist of secondary data obtained from books, documents, and archives containing relevant information. This research employs data collection techniques by gathering information from pre-existing data sources such as books, journals, reports, the internet, and other documents. The estimated time required to conduct this research is two months (November-December 2022). This research develops a responsive web journal using the Laravel Framework and the Knuth Morris Pratt (KMP) algorithm for journal data search. The implementation of the KMP algorithm resulted in a search time of approximately 0.505 seconds with 15 keywords.

Game for Sasak Script Based on Knuth Morris Pratt Algorithm and ADDIE Model

Knowledge of the Sasak script is very few Sasak people are interested in learning it. The writing system of the Sasak script is in danger of becoming extinct, so the local government must carry out literacy education so that the Sasak script does not become extinct from the face of the Lombok earth and must be applied to elementary and junior high schools, not only in the learning and teaching process. Directing children can be done by introducing them to the game-based Sasak baluk olas script. The Sasak script game based on KMP (Knuth Morris Pratt) Algorithm and ADDIE (Analysis, Design, Development, Implementation, Evaluation) which integrates game thinking and game elements has proven helpful in learning new knowledge. For this reason, the purpose of this study is to discuss how to develop applications for the Sasak Baluk Olas script on smartphones based on the Android system. designed based on the famous visual novel concept that combines multimedia elements including audio, animation, graphics, and images to make it more interesting and lively. All of these elements combine with gamification elements such as quizzes, rewards, badges, and feedback to make it a gamification application. Based on all the abilities of the Sasak Baluq Olas script, it can help potential users, especially elementary and junior high school students in Mataram City to increase the level of understanding and awareness of the Sasak script so that it does not become extinct

Kamus Digital Tanaman Obat Menggunakan Algoritme Knuth Morris Pratt Berbasis Mobile

Digital dictionary of medicinal plants a collection of applications a collection of names of medicinal plants. This application was developed to make it easier for users to access the use of medicinal plants based on keywords, names of common diseases such as asthma, diarrhea, fever, headache, diabetes, and so on. The obstacle in using the digital dictionary application of medicinal plants is that it is difficult to find exact information on drug searches, because the vocabulary in producing several other items is not necessarily the same as what is being sought. This study uses the Knuth Morris Pratt (KMP) algorithm search technique on a digital dictionary of medicinal plants by matching keywords as input with strings between text and patterns. This study aims to develop previous research on a digital dictionary of medicinal plants using a mobile-based Rocchio algorithm that searches medicinal plant data by querying proximity in a database that has weaknesses in words that have the same meaning with different words, using another search technique, namely KMP. is expected to get optimal results on search results based on the keyword name of the disease. The test results with 30 keywords on 640 medicinal plant data resulted in a precision value of 92.4, accuracy and recall of 100%.

Data Analysis of COVID-19 Hospital Records Using Contextual Patient Classification System.

Humanity today is suffering from one of the most dangerous pandemics in history, the Coronavirus Disease of 2019 (COVID-19). Although today there is immense advancement in the medical field with the latest technology, the COVID-19 pandemic has affected us severely. The virus is spreading rapidly, resulting in an escalation in the number of patients admitted. We propose a contextual patient classification system for better analysis of the data from the discharge summary available from the research hospital. The classification was done using the Knuth–Morris–Pratt algorithm. We have also analyzed the data of COVID-19 and non-COVID-19 patients. During the analysis, studies on the medicines, medical services and tests, pulse count, body temperature, and the overall effect of age and gender was done. The death versus survival ratio for the COVID-19 positive patients has also been studied. The classification accuracy of the contextual patient classification system achieved was 97.4%. The combination of data analysis and contextual patient classification will be helpful to all the sectors to be better prepared for any future waves of the COVID-19 pandemic.

Knuth Morris Pratt String Matching Algorithm in Searching for Zakat Information and Social Activities

Algorithms are one of the components that need to be considered in the development of information systems. Determination of the algorithm is adjusted to the purpose of the system to be built. One algorithm that can be used is string matching. The string matching algorithm will play a role in searching for a string consisting of several characters (usually called a pattern). The method used in this research is string matching knuth morris pratt (KMP) which is used to search zakat information and social activities in the search engine system. KMP is a string matching algorithm with good performance. The results showed the performance of string matching using the KMP algorithm with 5 trials of input pattern on zakat information with execution times of 0.03 ms, 0.03 ms, 0.02 ms, 0.02 ms and 0.03 ms. And 5 times the input pattern experiment on social activities with execution time of 0.02 ms, 0.02 ms, 0.03 ms, 0.03 ms and 0.02 ms. Thus the average execution time of the KMP algorithm in string matching is 0.026 ms and 0.024 ms.

Review on String-Matching Algorithm

String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content. The most classical and famous string-search algorithms are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (DM) algorithm. These two algorithms provide efficient heuristic jump rules by prefix or suffix. Bitap algorithm was the first to introduce bit-parallelism into string-matching field. Backward Non-Deterministic DAWG Matching (BNDM) algorithm is a modern practical algorithm that is an outstanding combination of theoretical research and practical application. Those meaningful algorithms play a guiding role in future research in string-search algorithm to improve the average performance of the algorithm and reduce resource consumption.

PERANCANGAN APLIKASI SISTEM INFORMASI PENJUALAN RUMAH BERBASIS MOBILE WEB DENGAN METODE STRING MATCHING (STUDI KASUS: BUANA PROPERTI)

Buana Property is one of the developers in the housing sector or is engaged in the business of selling, buying, and renting property. Advances in technology make Buana properties that always want to grow and be better known in the community with the construction of a mobile commerce system. So far, the system at Buana Properti is still a physical store that is offline so it is not well known to the public, there is no housing sales information system that uses a mobile web system. Therefore, this system is needed to simplify the process of selling housing at Buana Properti Medan which makes it easier for buyers to make house purchases at Buana Property. The system built will also provide a home search feature where this search feature is built using the String Matching method with the Knuth-Morris Pratt (KMP) model. The system that has been built itself uses HTML and PHP programming languages ​​in building mobile web and MySQL as a place database storage. The results of this study are that this system can assist buyers in finding homes that match their wishes and make purchase and payment transactions more easily.

Perbandingan Algoritma N-gram dan Algoritma Knuth Morris Pratt untuk Mengukur Tingkat Akurasi Plagiarisme pada Dokumen Abstrak Skripsi Berbasis Website


 
 
 
 Plagiarism is a crime that often occurs in the academic world, plagiarism occurs because of theft of other people's work that is illegally recognized as if the work is his own. N-gram is an algorithm by cutting as many characters as N-characters in a sentence or word. While the Knuth Morris Pratt (KMP) algorithm is a string search algorithm, this algorithm is used to maintain information that is used to carry out the number of shifts whenever there is no matched patency in the text. The purpose of this study is to create a system to measure the comparison of the accuracy of the N-gram algorithm with a website-based KMP on a thesis abstract document. This research uses the waterfall system development method which has stages, namely analysis, design, coding, and testing. The KMP test results are better than N-gram where kmp has an average percentage of 3.8% while the N-gram 3.5% results are obtained from an average of 10 trials and 5 documents tested.
 
 
 

Automata-based Algorithm for Multiple Word Matching

In this paper, an automata-based algorithm that finds the valid shifts of a given set of words W in text T is presented. Unlike known string matching algorithms, a preprocessing phase is applied to T and not to the words being searched for. In this phase, a deterministic finite state automaton (DFA) that recognizes the words in T is built and is augmented with their shifts in T. The preprocessing phase is relatively expensive in terms of time and space. However, it needs to be done once for any number of words to match in a given text document. The algorithm is analyzed for complexity, implemented and compared with an adjusted version of KMP algorithm. It showed better performance than KMP algorithm for large number of words to match in T.

Fuzzy String Matching Using a Prefix Table

The string matching problem (that is, the problem of finding all occurrences of a pattern in the text) is one of the well-known problems in symbolic computations with applications in many areas of artificial intelligence. The most famous algorithms for solving it are the finite state machine method and the Knuth-Morris-Pratt algorithm (KMP). In this paper, we consider the problem of finding all occurrences of a fuzzy pattern in the text. Such a pattern is defined as a sequence of fuzzy properties of text characters. To construct a solution to this problem, we introduce a two-dimensional prefix table, which is a generalization of the one-dimensional prefix array used in the KMP algorithm.

String Matching untuk Mendeteksi Serangan Sniffing (ARP Spoofing) pada IDS Snort

Sniffing technique (ARP Spoofing) is an attack that sends fake ARP packets or ARP packets that have been modified according to the network address attacker's to poison the victim's ARP cache table. ARP spoofing attack is a dangerous attack because it can monitor the activities of victims in searching the browser and can steal social logins, office and other accounts. This attack supports the occurrence of other computer network attacks such as Denial of service, Man in the middle attack, host impersonating and others. Sniffing attacks are generally found in places that provide public Wi-Fi such as campus, libraries, cafes, and others. IDS Snort can detect sniffing attacks (Arp Spoofing). String Matching Method KMP algorithm is applied to detect attacks on snort logging files to provide alerts (messages) to users. Tests carried out are black box testing to test application functionality, and accuracy testing. All application functionality was successful, and testing the accuracy of the match between manual calculations for string matching and accurate application.

Comparison of search algorithms in Javanese-Indonesian dictionary application

This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. Performance Testing is used to test the performance of algorithm implementations in applications. The test results show that the Boyer Moore and Knuth Morris Pratt algorithms have an accuracy rate of 100%, and the Horspool algorithm 85.3%. While the processing time, Knuth Morris Pratt algorithm has the highest average speed level of 25ms, Horspool 39.9 ms, while the average speed of the Boyer Moore algorithm is 44.2 ms. While the complexity test results, the Boyer Moore algorithm has an overall number of n 26n 2 , Knuth Morris Pratt and Horspool 20n 2 each.

A novel technique to prevent SQL injection and cross-site scripting attacks using Knuth-Morris-Pratt string match algorithm

Structured Query Language (SQL) injection and cross-site scripting remain a major threat to data-driven web applications. Instances where hackers obtain unrestricted access to back-end database of web applications so as to steal, edit, and destroy confidential data are increasing. Therefore, measures must be put in place to curtail the growing threats of SQL injection and XSS attacks. This study presents a technique for detecting and preventing these threats using Knuth-Morris-Pratt (KMP) string matching algorithm. The algorithm was used to match user’s input string with the stored pattern of the injection string in order to detect any malicious code. The implementation was carried out using PHP scripting language and Apache XAMPP Server. The security level of the technique was measured using different test cases of SQL injection, cross-site scripting (XSS), and encoded injection attacks. Results obtained revealed that the proposed technique was able to successfully detect and prevent the attacks, log the attack entry in the database, block the system using its mac address, and also generate a warning message. Therefore, the proposed technique proved to be more effective in detecting and preventing SQL injection and XSS attacks

EMPIRICAL PERFORMANCE EVALUATION OF KNUTH MORRIS PRATT AND BOYER MOORE STRING MATCHING ALGORITHMS

Manyalgorithms have been proposed for string matching in order to find a specific pattern in a given text. These algorithms have been used in many applications such as software editors, genetics, Internet search engines, natural language processing, etc. Theaim of this paper is to evaluate the performance of two popularalgorithms:BoyerMoore (BM) and KnuthMorrisPratt (KMP) in terms of execution time. The algorithms have been programmed usingJava and Java Microbenchmark Harnessto evaluatetheirexecution timeusinganumber of experimentaltest scenarios.Resultsshowthat the BMalgorithm outperformed the KMPalgorithm in all test scenarios

Evaluation of the accuracy of winnowing, rabin karp and knuth morris pratt algorithms in plagiarism detection applications

The unethical behaviour of acts of plagiarism has been a disgrace in the educational realm. Using the internet, people can easily find articles or documents that are relevant to their current work, and simply duplicate the sentences or paragraphs without paraphrasing or giving correct citations. Such action falls into the area of plagiarism. In order to minimize the problem, especially in the educational field, it is necessary to develop plagiarism detection applications. The algorithm employed in the application plays an important role in obtaining accurate plagiarism detection results. To the best of our knowledge, three algorithms are commonly used in plagiarism detection applications, namely Winnowing, Rabin Karp and Knuth Morris Pratt, which are all employed in our application. To specify the accuracy of each algorithm, the percentages of the plagiarism detection results are compared to the results from examination by a human expert. From our results, we found that the order of the accuracy from highest to lowest corresponded to the Winnowing algorithm, Rabin Karp algorithm and Knuth Morris Pratt algorithm, with value differences of 1.19%, 53.91% and 83.91% respectively.