Algoritma Jaro-Winkler Distance: Fitur Autocorrect dan Spelling Suggestion pada Penulisan Naskah Bahasa Indonesia di BMS TV

Prasetyo, Agung; Baihaqi, Wiga Maulana; Had, Iqbaluddin Syam

doi:10.25126/jtiik.201854780

Cited by 8 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…previous researchers, namely, the autocorrect and the spelling suggestion [15], [16] feature, detecting plagiarism document [17]- [26], stemming the word compensated is not standard English by Qulub, et al, 2020 [27]. In 2016, Rochmawati, et al [13] conducted research that compared the algorithm of the search string in the approximate string matching methods to identify errors typing text.…”

Section: Similarity Score Finishmentioning

confidence: 99%

The Hybrid of Jaro-Winkler and Rabin-Karp Algorithm in Detecting Indonesian Text Similarity

Yulianto

Nurhasanah

2021

join

View full text Add to dashboard Cite

The String-matching technique is part of the similarity technique. This technique can detect the similarity level of the text. The Rabin-Karp is an algorithm of string-matching type. The Rabin-Karp is capable of multiple patterns searching but does not match a single pattern. The Jaro-Winkler Distance algorithm can find strings within approximate string matching. This algorithm is very suitable and gives the best results on the matching of two short strings. This study aims to overcome the shortcomings of the Rabin-Karp algorithm in the single pattern search process by combining the Jaro-Winkler and Rabin-Karp algorithm methods. The merging process started from pre-processing and forming the K-Gram data. Then, it was followed by the calculation of the hash value for each K-Gram by the Rabin-Karp algorithm. The process of finding the same hash score and calculating the percentage level of data similarity used the Jaro-Winkler algorithm. The test was done by comparing words, sentences, and journal abstracts that have been rearranged. The average percentage of the test results for the similarity level of words in the combination algorithm has increased. In contrast, the results of the percentage test for the level of similarity of sentences and journal abstracts have decreased. The experimental results showed that the combination of the Jaro-Winkler algorithm on the Rabin-Karp algorithm can improve the similarity of text accuracy.

show abstract

Section: Similarity Score Finishmentioning

confidence: 99%

The Hybrid of Jaro-Winkler and Rabin-Karp Algorithm in Detecting Indonesian Text Similarity

Yulianto

Nurhasanah

2021

join

View full text Add to dashboard Cite

show abstract

“…Pada contoh perhitungan berikut ini diambil dari penelitain Prasetyo [11], misalkan pengguna ingin menulis kata "tidur", namun terjadi kesalahan ketik sehingga tertulis kata "tdyr". Pada kasus ini akan dilakukan perhitungan kedekatan jarak kata "tdyr" dengan semua kata yang jumlah karakternya empat sampai enam karakter pada database.…”

Section: Contoh Perhitungan Algoritma Jaro-winkler Distanceunclassified

Stemming Kata Berimbuhan Tidak Baku Bahasa Indonesia Menggunakan Algoritma Jaro-Winkler Distance

Qulub¹,

Utami²,

Sunyoto³

2020

citec

View full text Add to dashboard Cite

AbstrakBahasa merupakan media untuk mengekspresikan keinginan, gagasan, dan perasaan. Dalam kaitannya dengan bahasa indonesia, bahasa dapat mencerminkan prilaku dalam sebuah masyarakat. Bahasa indonesia dapat digunakan secara formal maupun non-formal. Bahasa nonformal berbentuk kata tidak baku yang biasanya digunakan dalam komentar atau posting dalam media sosial. Salah satu contoh kata tidak baku adalah "nemenin" yang kata formalnya "menemani" dan kata dasarnya adalah "teman". Dalam penelitian ini akan dilakukan pengujian akurasi algoritma Jaro-Winkler distance dalam mengubah kata imbuhan tidak baku menjadi bentuk dasarnya, proses ini disebut dengan stemming. Penelitian ini menggunakan data sebanyak 60 kata berimbuhan tidak baku. Hasil pengujian menunjukkan tingkat akurasi algoritma Jaro-Winkler sebesar 85% atau 51 kata berhasil di-stemming (3 overstemming, 6 unstemming, 0 understemming). AbstractLanguage that represents the media to attract interest, regulate, and feel. In reversing it with Indonesian, language can reflect behavior in a society. Indonesian can be used formally or informally. Non-formal language in the form of non-formal words used in comments or posts on social media. One example of a non-formal word is "accompanying" the formal word "accompany" and the basic word is "friend". In this research, the Jaro-Winkler algorithm will be tested the distance in changing non-formal affix words into a form of interaction, this process is called stemming. This research uses data as many as 60 words that are not standardized. The test results show the level of testing of the Jaro-Winkler algorithm is 85% or 51 words successfully stemmed (3 overstemming, 6 unstemming, 0 understemming).

show abstract

“…Namun sebaliknya, jika ditemukan adanya ketidakcocokan, maka kata yang diproses dianggap salah dan dilakukan penghitungan jarak kedekatannya dengan daftar kata dalam basis data. Nilai jarak kedekatan yang besar menandakan adanya kemiripan antara kata yang dibandingkan, sedangkan nilai jarak kedekatan yang kecil menandakan tidak adanya kemiripan [16].…”

Section: B Analisis Jaro-winkler Distanceunclassified

Kombinasi Damerau Levenshtein dan Jaro-Winkler Distance Untuk Koreksi Kata Bahasa Inggris

Indriyono¹

2020

JuTISI

View full text Add to dashboard Cite

Writing is one of the efforts made by the writer to express ideas and ideas to others. But sometimes when writing, there are many errors in typing spelling, especially English spelling, resulting in errors in capturing the meaning and meaning of the writing. To overcome this problem, we need a system that can detect word spelling errors. Damerau Levenshtein and Jaro Winkler Distance Algorithms are algorithms that can be used as a solution to detect English typing errors. From the test results, it can be concluded that the Damerau Levenshtein and Jaro-Winkler Distance are able to optimally detect word mismatches and look for similarities of words compared. The Damerau Levenshtein Distance works by finding the smallest distance value, while the Jaro-Winkler Distance works by finding the greatest proximity value of the string being compared. Using this algorithm, errors in writing the spelling of words can be minimized. Keywords— Algorithm; Damerau Levenshtein; Jaro Winkler; Spelling Cheker; String Matching.

show abstract

Algoritma Jaro-Winkler Distance: Fitur Autocorrect dan Spelling Suggestion pada Penulisan Naskah Bahasa Indonesia di BMS TV

Cited by 8 publications

References 5 publications

The Hybrid of Jaro-Winkler and Rabin-Karp Algorithm in Detecting Indonesian Text Similarity

The Hybrid of Jaro-Winkler and Rabin-Karp Algorithm in Detecting Indonesian Text Similarity

Stemming Kata Berimbuhan Tidak Baku Bahasa Indonesia Menggunakan Algoritma Jaro-Winkler Distance

Kombinasi Damerau Levenshtein dan Jaro-Winkler Distance Untuk Koreksi Kata Bahasa Inggris

Contact Info

Product

Resources

About