Ridwan, Mohamad Dede (2022) ALGORITMA PENCARI NILAI SIMILARITY PADA DOKUMEN. S1 thesis, Universitas Mercu Buana Jakarta-Menteng.
|
Text (Abstrak)
ABSTRAK - MOHAMAD DEDE RIDWAN.pdf Download (50kB) | Preview |
|
Text (Jurnal Mahasiswa)
KOMPRE+41517110156+MOHAMAD DEDE RIDWAN - MOHAMAD DEDE RIDWAN.pdf Restricted to Registered users only Download (598kB) |
||
Text (Form Keabsahan dan Publikasi)
Form Pernyataan Keaslian dan Persetujuan Unggah dan Publikasi Tugas Akhir - MOHAMAD DEDE RIDWAN.pdf Restricted to Repository staff only Download (159kB) |
||
Text (Form Tanda Terima TU)
TTTATU+41517110156+MOHAMAD DEDE RIDWAN - MOHAMAD DEDE RIDWAN - MOHAMAD DEDE RIDWAN.pdf Restricted to Repository staff only Download (177kB) |
Abstract
Banyak jenis karya tulis dari karya tulis sastra, novel, jurnal ilmu komputer dan lain sebagainya. Akan tetapi banyak karya tulis yang di salin ulang tanpa seizin penulis tindakan ini merupakan plagiarisme karya tulis, tindakan pencegahan yang dapat dilakukan agar karya tulis kita tidak disebut sebagai plagiarisme dengan membandingkan similarity pada tulisan yang dibuat. Ada berbagai jenis algoritma yang dapat digunakan untuk mencari kemiripan kata seperti algoritma Jaro-Winkler, Rabin-Karp, dan Levenshtein Distance. Ketiga algoritma ini dapat mencari kemiripan pada dokumen dengan baik. Pada kumpulan jurnal yang ada disini akan di jelaskan bagai mana kinerja dari algoritma tersebut terutama algoritma Levenshtein Distance dan Jaro-Winkler. Kata kunci: Plagiarisme, similarity, Jaro-Winkler, levenshtein distance universitas mercu buana Many types of written work from literary works, novels, computer science journals and so on. However, many written works are copied without the permission of the author. This action is written plagiarism, a preventive measure that can be taken so that our writing is not called plagiarism by comparing the similarity of the writings made. There are various types of algorithms that can be used to search for word similarity such as the Jaro-Winkler, Rabin-Karp, and Levenshtein Distance algorithms. These three algorithms can look for similarities in documents well. In the collection of journals here, it will be explained how the performance of the algorithm, especially the Levenshtein Distance and Jaro-Winkler algorithms. Key words: Plagiarisme, similarity, Jaro-Winkler, levenshtein distance universitas mercu buana
Item Type: | Thesis (S1) |
---|---|
NIM/NIDN Creators: | 41517110156 |
Uncontrolled Keywords: | Plagiarisme, similarity, Jaro-Winkler, levenshtein distance universitas mercu buana, Plagiarisme, similarity, Jaro-Winkler, levenshtein distance universitas mercu buana |
Subjects: | 000 Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 000. Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 004 Data Processing, Computer Science/Pemrosesan Data, Ilmu Komputer, Teknik Informatika |
Divisions: | Fakultas Ilmu Komputer > Informatika |
Depositing User: | Maulana Arif Hidayat |
Date Deposited: | 20 Apr 2022 04:50 |
Last Modified: | 20 Apr 2022 04:51 |
URI: | http://repository.mercubuana.ac.id/id/eprint/60222 |
Actions (login required)
View Item |