scholarly journals Aplikasi Pengecekan Dokumen Digital Tugas Mahasiswa Berbasis Website

2020 ◽  
Vol 11 (2) ◽  
pp. 93
Author(s):  
Latius Hermawan ◽  
Maria Bellaniar Ismiati
Keyword(s):  
String Matching ◽  
Plagiarism Detection ◽  
Matching Method ◽  
Text Documents ◽  
Matching Algorithm ◽  
The Common ◽  
Copy And Paste ◽  
Online Sources

Abstract. Website-Based Application for Checking Students’ Digital Assignment. Nowadays, technology is not only about computers as it has advanced to smartphones and other things. In UKMC, technology has certainly helped the job. However, in this university, there is no application for checking the plagiarism of the students’ digital assignments, whereas plagiarism is sometimes done by students when working on assignments from online sources. Students’ assignments can be easily done by doing copy and paste without mentioning its reference because students tend to think practically when working on assignments. Plagiarism is strictly prohibited in education because it is not permitted. Therefore, a plagiarism detection application should be created. It applies a string-matching algorithm in text documents to search the common words between documents. By applying the string-matching method in document that match with other documents, an output that will provide information on how similar the text documents are can be generated. After testing, it is obtained that this application can help lecturers and students to reduce the level of plagiarism.Keywords: Application, Plagiarism, Digital, Assignment Abstrak. Sekarang teknologi tidak hanya tentang computer karena kemajuannya telah merambah pada smartphone, dan hal- hal lainnya. Di UKMC, teknologi yang digunakan sudah sangat membantu pekerjaan. Namun di universitas ini, belum ada aplikasi yang dapat memeriksa plagiarisme dari tugas digital mahasiswa padahal plagiarisme terkadang dilakukan oleh mahasiswa saat mengerjakan tugas dari sumber online. Tugas mahasiswa dapat dengan mudah dibuat dengan cara copy-paste tanpa menyebutkan referensi, karena siswa cenderung berpikir praktis ketika mengerjakan tugas. Plagiarisme sangat dilarang dalam pendidikan karena tidak diizinkan. Oleh karena itu aplikasi pendeteksi plagiarisme perlu dibuat. Aplikasi ini menerapkan algoritma pencocokan string dalam dokumen teks untuk mencari kata-kata umum antar dokumen. Dengan metode pencocokan string pada dokumen yang cocok dengan beberapa dokumen lainnya dapat dihasilkan suatu keluaran yang akan memberikan informasi seberapa dekat antar dokumen teks tersebut. Setelah dilakukan pengujian, didapat hasil bahwa aplikasi ini dapat membantu dosen dan mahasiswa untuk mengurangi tingkat plagiarisme.Kata Kunci: aplikasi, plagiarisme, tugas kuliah.

Text Documents Plagiarism Detection using Rabin-Karp and Jaro-Winkler Distance Algorithms

2017 ◽  
Vol 5 (2) ◽  
pp. 462 ◽  
Author(s):  
Brinardi Leonardo ◽  
Seng Hansun
Keyword(s):  
Detection System ◽  
String Matching ◽  
Experimental Results ◽  
Plagiarism Detection ◽  
Text Documents ◽  
Matching Algorithm ◽  
Text Document ◽  
Different Types ◽  
The University

Plagiarism is an act that is considered by the university as a fraud by taking someone ideas or writings without mentioning the references and claimed as his own. Plagiarism detection system is generally implement string matching algorithm in a text document to search for common words between documents. There are some algorithms used for string matching, two of them are Rabin-Karp and Jaro-Winkler Distance algorithms. Rabin-Karp algorithm is one of compatible algorithms to solve the problem of multiple string patterns, while, Jaro-Winkler Distance algorithm has advantages in terms of time. A plagiarism detection application is developed and tested on different types of documents, i.e. doc, docx, pdf and txt. From the experimental results, we obtained that both of these algorithms can be used to perform plagiarism detection of those documents, but in terms of their effectiveness, Rabin-Karp algorithm is much more effective and faster in the process of detecting the document with the size more than 1000 KB.

scholarly journals IMPLEMENTASI BOYER-MOORE PADA APLIKASI PENCARIAN RUMUS MATEMATIKA DAN FISIKA

2016 ◽  
Vol 3 (1) ◽  
Author(s):  
Halim Agung ◽  
Yogyawan Yogyawan
Keyword(s):  
High School ◽  
High School Students ◽  
Pattern Matching ◽  
String Matching ◽  
Matching Method ◽  
School Students ◽  
Matching Algorithm ◽  
Testing Method ◽  
The One ◽  
Mathematics And Physics

[Id]Sulitnya mencari dan menghafalkan rumus matematika dan fisika menjadi kendala bagi sebagian pelajar SMA terutama dalam menjawab soal yang ada. Dibutuhkan ketelitian untuk menentukan apa saja yang tercantum dalam soal tersebut. Penelitian ini meneliti bagaimana cara melakukan pendeteksian kata kunci yang terdapat pada soal matematika dan fisika sekaligus dicocokkan dengan menggunakan metode pencocokan kata. Algoritma yang digunakan untuk melakukan pencocokan kata adalah algoritma Boyer-Moore. Setiap data kata kunci yang ada di basis data akan diambil berdasarkan fisika atau matematika, kemudian dipecah per kata. Setelah data kata kunci sudah dipecah menjadi per kata, tiap kata kunci akan melakukan pencocokkan ke soal yang dimasukkan pengguna dengan metode pencocokkan kata. Setelah dicocokkan dan hasil pencocokkan berhasil, aplikasi akan menampilkan daftar rumus yang memiliki kata kunci cocok dengan yang ada di soal. Pengujian metode pencocokan kata dengan algoritma Boyer-Moore pada soal matematika dan fisika yang sebanyak 30 kali membuktikan bawah aplikasi dapat menampilkan daftar rumus yang sesuai dalam melakukan pencocokkan pola kata kunci di soal baik matematika maupun fisika tingkat SMA.Kata kunci :Pencocokan Kata Kunci, Boyer-Moore, Rumus, Matematika, Fisika[en]Difficult to find and memorize math and physics becomes an obstacle for the majority of high school students, especially in answering the questions that exist. It takes precision to determine what is stated in the question. This study investigated how to make the detection of keywords contained in the math and physics as well matched using string matching method. The algorithm used to perform string matching algorithm is the Boyer-Moore. Each keyword data in the database will be taken based on the physics or mathematics, then broken down per word. Once the data has been broken down into key words per word, every keyword will perform matching to the matter that the user entered with a string matching method. Once matched and the matching result is successful, the application will display a list of formulas that have keywords match the one in question. Testing method of string matching algorithms Boyer-Moore in math and physics as much as 30 times to prove under the application can display a list of the appropriate formula in performing the pattern matching keywords in a matter of both mathematics and physics high school level.Keywords : String Matching, Boyer-Moore, Formula, Math, Physics.

scholarly journals PERANCANGAN DAN PENERAPAN ALGORITMA RIZKI TANJUNG 24 (RTG24) UNTUK KOMPARASI KATA PADA FILE TEXT

Compiler ◽  
2014 ◽  
Vol 3 (1) ◽  
Author(s):  
Rizki Tanjung ◽  
Haruno Sajati ◽  
Dwi Nugraheny
Keyword(s):  
String Matching ◽  
Plagiarism Detection ◽  
Text Documents ◽  
Text Document ◽  
Basic Word ◽  
Root Word

Plagiarism is the act of taking essay or work of others, and recognize it as his own work. Plagiarism of the text is very common and difficult to avoid. Therefore, many created a system that can assist in plagiarism detection text document. To make the detection of plagiarism of text documents at its core is to perform string matching. This makes the emergence of the idea to build an algorithm that will be implemented in RTG24 Comparison file.txt applications. Document to be compared must be a file. Txt or plaintext, and every word contained in the document must be in the dictionary of Indonesian. RTG24 algorithm works by determining the number of same or similar words in any text between the two documents. In the process RTG24 algorithm has several stages: parsing, filtering, stemming and comparison. Parsing stage is the stage where every sentence in the document will be broken down into basic words, filtering step is cleaning the particles are not important. The next stage, stemming is the stage where every word searchable basic word or root word, this is done to simplify and facilitate comparison between the two documents. Right after through the process of parsing, filtering, and stemming, then the document should be inserted into the array for the comparison or the comparison between the two documents. So it can be determined the percentage of similarity between the two documents.

scholarly journals Aplikasi Pendeteksi Tingkat Kesamaan Dokumen Teks: Algoritma Rabin Karp Vs. Winnowing

2018 ◽  
Vol 9 (1) ◽  
pp. 82-93
Author(s):  
Sugiono Sugiono ◽  
Herwin Herwin ◽  
Hamdani Hamdani ◽  
Erlin Erlin
Keyword(s):  
Word Processing ◽  
Processing Time ◽  
Code Of Conduct ◽  
Scientific Writing ◽  
Plagiarism Detection ◽  
Text Similarity ◽  
Text Documents ◽  
Processing Application ◽  
Text Document ◽  
Copy And Paste

Tindakan copy paste dokumen teks sering terjadi dalam penulisan karya ilmiah tanpa memberikan kredit kepada yang mempunyai dokumen teks tersebut. Tindakan melanggar kode etik ini disebabkan karena tersedianya fasilitas menyalin dan menempel teks pada aplikasi pengolah kata. Tujuan dari penelitian ini adalah untuk membangun sebuah aplikasi yang mampu mendeteksi tingkat kesamaan dokumen teks dengan terlebih dahulu membandingkan tingkat kehandalan dari dua algoritma pendeteksi kesamaan teks yaitu algoritma rabin-karp dan algoritma winnowing. Perbandingan dilakukan terhadap dua variabel yaitu tingkat kemampuan mendeteksi dan waktu pemrosesan. Hasil menunjukkan bawah algoritma winnowing lebih unggul dibandingkan algoritma rabin-karp dari sisi tingkat akurasi maupun dari sisi waktu pemrosesan.  Abstract The behavior of copy pastes the text document often occurs in scientific writing without giving credit to those who have the text document. The behavior of this missing code of conduct due to the availability of facility to copy and paste the text in a word processing application. The purpose of this study is to build an application that can detect the index of similarity of text documents by first comparing the level of reliability of the two text similarity algorithms, i.e., Rabin-Karp and Winnowing. The comparison is measured based on two variables; the level of capability of detecting and processing time. The result shows that Winnowing algorithm outperforms Rabin-Karp in term of both accuracy and processing time.   Keywords: Rabin-Karp, Winnowing, Plagiarism Detection, Text Similarity  

scholarly journals Contribution to Semantic Analysis of Arabic Language

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Anis Zouaghi ◽  
Mounir Zrigui ◽  
Georges Antoniadis ◽  
Laroussi Merhbene
Keyword(s):  
Information Retrieval ◽  
Semantic Analysis ◽  
String Matching ◽  
Ambiguous Word ◽  
Arabic Language ◽  
New Approach ◽  
Matching Algorithm ◽  
Ambiguous Words ◽  
Lesk Algorithm ◽  
Context Of Use

We propose a new approach for determining the adequate sense of Arabic words. For that, we propose an algorithm based on information retrieval measures to identify the context of use that is the closest to the sentence containing the word to be disambiguated. The contexts of use represent a set of sentences that indicates a particular sense of the ambiguous word. These contexts are generated using the words that define the senses of the ambiguous words, the exact string-matching algorithm, and the corpus. We use the measures employed in the domain of information retrieval, Harman, Croft, and Okapi combined to the Lesk algorithm, to assign the correct sense of those proposed.

Sign in / Sign up

Export Citation Format

Share Document