Dictionary Distribution Based on Number of Characters for Damerau-Levenshtein Distance Spell Checker Optimization

摘要

Damerau-Levenshtein Distance is an algorithm that can solve word correction problems. This algorithm changes one word into another word using a specified set of edit operations. In word correction using Damerau-Levenshtein Distance, edit operations that can be performed are: substitution, insertion, deletion and transposition. However, the Damerau-Levenshtein Distance algorithm also has a weakness, which is a long processing time. In order for the system to be able to display word suggestions on the wrong string, the system must calculate the word with each word in the dictionary. The processing time will be longer if the dictionary used is very large, for example, the Indonesian Dictionary has more than 30,000 basic words. So that in this study, a dictionary distribution based on the number of characters to shorten the processing time. The use of a distributed dictionary speeds up the Damerau-Levenshtein Distance algorithm by 29.04 seconds.