Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
