2000 character limit reached
Introduction of the weight edition errors in the Levenshtein distance (1208.4503v1)
Published 22 Aug 2012 in cs.CL
Abstract: In this paper, we present a new approach dedicated to correcting the spelling errors of the Arabic language. This approach corrects typographical errors like inserting, deleting, and permutation. Our method is inspired from the Levenshtein algorithm, and allows a finer and better scheduling than Levenshtein. The results obtained are very satisfactory and encouraging, which shows the interest of our new approach.