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

Dwi Krisbiantoro, Sofyan Fathur Rohim, Irfan Santiko
{"title":"Perbandingan Algoritma N-gram dan Algoritma Knuth Morris Pratt untuk Mengukur Tingkat Akurasi Plagiarisme pada Dokumen Abstrak Skripsi Berbasis Website","authors":"Dwi Krisbiantoro, Sofyan Fathur Rohim, Irfan Santiko","doi":"10.36596/jitu.v5i1.390","DOIUrl":null,"url":null,"abstract":"\n \n \n \nPlagiarism 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. \n \n \n \n","PeriodicalId":185704,"journal":{"name":"JITU : Journal Informatic Technology And Communication","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JITU : Journal Informatic Technology And Communication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36596/jitu.v5i1.390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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.
比较N-gram算法和Knuth Morris Pratt的算法来衡量基于网站的论文摘要上的剽窃率
剽窃是一种经常发生在学术界的犯罪行为,剽窃的发生是因为盗用了他人的作品而被非法认定为是自己的作品。N-gram是在一个句子或单词中截取n个字符的算法。Knuth Morris Pratt (KMP)算法是一种字符串搜索算法,该算法用于维护用于在文本中没有匹配的透明度时执行移位次数的信息。本研究的目的是创建一个系统来衡量N-gram算法与基于网站的KMP在论文摘要文档上的准确性比较。本研究采用瀑布系统开发方法,该方法分为分析、设计、编码和测试四个阶段。KMP测试结果优于N-gram测试结果,其中KMP的平均百分比为3.8%,而N-gram测试结果为3.5%,平均测试10个试验和5个文档。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信