Levenshtein Algorithm also known as Levenshtein distance, is an algorithm which measures distance between words and also it is also used for conversion from one word to another. Measuring the distance between words is done by measuring the distance between the characters used in those words. Levenshtein algorithm works quite well for alphabets which in their composition have only letters consisting of a single character such as English language, but in cases where the alphabets have letters in their composition consisting of two or more characters such as Albanian language, this algorithm does not calculate the proper distance. Albanian language has 9 letters composed of two characters, namely dh, gj, sh, th, ll, rr, nj, xh and zh, therefore a new approach has been proposed for such cases.