Efficient Error-Correcting Geocoding

We study the problem of resolving a perhaps misspelled address of a location into geographic coordinates of latitude and longitude. Our data structure solves this problem within a few milliseconds even for misspelled and fragmentary queries. Compared to major geographic search engines such as Google or Bing we achieve results of significantly better quality

Approximate String Matching and Applications to Indian Scripts

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.Computer Science Departmen

Building Blocks for Mapping Services

Mapping services are ubiquitous on the Internet. These services enjoy a considerable user base. But it is often overlooked that providing a service on a global scale with virtually millions of users has been the playground of an oligopoly of a select few service providers are able to do so. Unfortunately, the literature on these solutions is more than scarce. This thesis adds a number of building blocks to the literature that explain how to design and implement a number of features