Application of Substring Search Algorithms to Hindi based on Pattern Recognition

Substring search is a basic operation in all text processing applications. Among many algorithms for this purpose, there are three that are very common, namely Knuth-Morris-Pratt, Boyer-Moore and Rabin-Karp algorithms. All these are applied generally to English (byte-based text). This paper presents the experimental validation of these algorithms when they are applied to Hindi (UTF-8 encoded) text made up from 49000 unique Hindi words.