James Tirta Halim
Unknown Affiliation

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

PENDETEKSIAN KESALAHAN KETIK DENGAN DAMERAU-LEVENSHTEIN DISTANCE DAN TRIE James Tirta Halim; Lely Hiryanto; Irvan Lewenusa
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 13 No. 1 (2025): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v13i1.32854

Abstract

Typographical errors are commonly found in text. Many applications implement a spell checking feature to detect and correct typographical errors. Spell checking requires an algorithm to calculate the similarity of two strings. This study compares Damerau-Levenshtein Distance and Trie in checking and correcting typographical errors in the names of function calls in source code based on the processing time and accuracy of the spelling correction. Accuracy is calculated by classifying the results of the spelling correction in a Confusion Matrix. This study shows that Trie is faster than Damerau-Levenshtein Distance, in which Trie’s processing time took 10.07% of Damerau-Levenshtein Distance’s. However, Damerau-Levenshtein Distance can correct more types of typographical errors than Trie, yielding an accuracy of 89.7% compared to 45.71%.