scholarly journals Intelligent Predictive String Search Algorithm Using Two Sliding Windows in Parallel Environment

2020 ◽  
Vol 9 (4) ◽  
pp. 6346-6355
Author(s):  
Wafa Dababat
Keyword(s):  
Search Algorithm ◽  
Sliding Windows ◽  
Parallel Environment ◽  
String Search

Implementing a faster string search algorithm in Ada

1988 ◽  
Vol VIII (3) ◽  
pp. 87-97
Author(s):  
P. Wood ◽  
D. Turcaso
Keyword(s):  
Search Algorithm ◽  
String Search

scholarly journals APLIKASI PENDETEKSI PLAGIARISME TUGAS DAN MAKALAH PADA SEKOLAH MENGGUNAKAN ALGORITMA RABIN KARP

2018 ◽  
Vol 1 (1) ◽  
Author(s):  
Danny Steveson ◽  
Halim Agung ◽  
Fendra Mulia
Keyword(s):  
Search Algorithm ◽  
Sentence Similarity ◽  
String Search ◽  
Frequent Problem ◽  
Sørensen Index

Plagiarism is a very frequent problem in all aspects of one occurring in school. There is often plagiarism on the content of the papers or assignments collected by the students. This is to support the decreasing creativity of students in giving ideas and personal opinions on the task given. To answer the above problems then this research using Rabin-Karp algorithm. Rabin-Karp algorithm is a string search algorithm that uses hashing to find one of a series of string patterns in text. Using this application, the user can compare document 1 with another document, which gives results in sentence similarity, then spelled out per word, followed by per hashing and is calculated from the average number of percentages. The test in this research is done by taking samples 50 times and in comparison between percentage with Rabin Karp algorithm and percentage with manual taking. Testing is done by comparing one document with another document. Based on the result of the research, it can be concluded by using Rabin Karp Algorithm, which can be implemented in plagiarism application evidenced by the test using 50 test samples with 43 samples of success of 14.22%.<br />Keywords: document , Rabin Karp Algorithm, Dice Sorensen Index, Plagiarism, sentence, word

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

2021 ◽  
Vol 5 (1) ◽  
pp. 30-39
Author(s):  
Dwi Krisbiantoro ◽  
Sofyan Fathur Rohim ◽  
Irfan Santiko
Keyword(s):  
Search Algorithm ◽  
System Development ◽  
Test Results ◽  
Academic World ◽  
Development Method ◽  
Average Percentage ◽  
Analysis Design ◽  
String Search ◽  
N Gram ◽  
Better Than

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.

scholarly journals Intelligent Predictive String Search Algorithm

2016 ◽  
Vol 79 ◽  
pp. 161-169 ◽  
Author(s):  
Dipendra Gurung ◽  
Udit Kr. Chakraborty ◽  
Pratikshya Sharma
Keyword(s):  
Search Algorithm ◽  
String Search

Similar string search algorithm based on Trie tree

2013 ◽  
Vol 33 (8) ◽  
pp. 2375-2378
Author(s):  
Lixia LIU ◽  
Zhiqiang ZHANG
Keyword(s):  
Search Algorithm ◽  
String Search

A parallel string search algorithm

1992 ◽  
Vol 22 (2) ◽  
pp. 332-336 ◽  
Author(s):  
Y. Takefuji ◽  
T. Tanaka ◽  
K.C. Lee
Keyword(s):  
Search Algorithm ◽  
String Search

scholarly journals RABIN-CARP IMPLEMENTATION IN MEASURING SIMALIRITY OF RESEARCH PROPOSAL OF STUDENTS

2020 ◽  
Vol 3 (1) ◽  
pp. 9
Author(s):  
Herman Herman ◽  
Lukman Syafie ◽  
Tasmil Tasmil ◽  
Muhammad Resha
Keyword(s):  
Hash Function ◽  
Search Algorithm ◽  
Large Data ◽  
Scientific Work ◽  
Test Results ◽  
Academic World ◽  
Matching Algorithm ◽  
Use Of Data ◽  
String Search ◽  
Student Thesis

Plagiarism is the use of data, language and writing without including the original author or source. The place where palgiate practice occurs most often is the academic environment. In the academic world, the most frequently plagiarized thing is scientific work, for example thesis. To minimize the practice of plagiarism, it is not enough to just remind students. Therefore we need a system or application that can help in measuring the level of similarity of student thesis proposals in order to minimize plagiarism practice. In computer science, the Rabin-Karp algorithm can be used in measuring the level of similarity of texts. The Rabin-Karp algorithm is a string matching algorithm that uses a hash function as a comparison between the search string (m) and substrings in text (n). The Rabin-Karp algorithm is a string search algorithm that can work for large data sizes. The test results show that the use of values on k-gram has an effect on the results of the measurement of similarity levels. In addition, it was also found that the use of the value 5 on k-gram was faster in executing than the values 4 and 6.

Sign in / Sign up

Export Citation Format

Share Document