Thumbnail Image

Approximate String Matching and Applications to Indian Scripts

Paruchuri, Venkata Ravinder
This thesis is concerned with the analysis of approximate string matching and its applications to Indian scripts. It starts with the analysis of the problem of the readability of jumbled text. Several modifications of jumbling are considered based on position of letters, such as using the Damerau- Levenshtein distance without disturbing the first letter, first and last letters and according to the placement of keys in the QWERTY keyboard. The process is applied to the Indian scripts and modifications are based on vowels, consonants and syllables in the respective languages. A study is made on the entropy of English language and then the entropy for Telugu language is calculated and compared to that of English language.