Spelling Correction Using the Levenshtein Distance and Nazief and Adriani Algorithm for Keyword Search Process Indonesian Qur'an Translation

Abstract

The Qur'an consists of 114 letters which has a total of 6,236 verses and 77,340 words which contains a lot of important information. The length of time used to obtain the expected information becomes an obstacle when the search is done manually. Therefore, it takes a search engine that can help to get that information. The problem with the search engine is that the input spelling of words is wrong, resulting in incorrect information. Levenshtein Distance algorithm can provide a solution to correct key input errors. The Levenshtein Distance algorithm is an edit distance algorithm that has three operations that are used to measure the distance between two strings. We conducted experiments to correct spellings that did not match the search keywords for the Indonesian translation of the Qur'an using the Levenshtein Distance and Nazief and Adriani Stemming algorithms. Based on Levenshtein Distance operation, 70% success in Insert operation, and 100 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">%</sup> success in remove and replace operation while on Stemming.