%0 Conference Paper %1 conf/etra/BeeldersB10 %A Arumugam, G. %A M.Thangaraj, %A Sasirekha, R. %B International Journal of Computer Science, Engineering and Information Technology (IJCSEIT) %D 2011 %E Morimoto, Carlos Hitoshi %E Istance, Howell O. %E Hyrskykari, Aulikki %E Ji, Qiang %I ACM %K IR String Syntactic Web matching searching %N 1 %P 09-19 %T TEXT ANALYZER %U http://airccse.org/journal/ijcseit/papers/0411cseit02.pdf %V 1 %X The web has become a resourceful tool for almost all domains today. Search engines prominently use inverted indexing technique to locate the web pages having the users query. The performance of inverted index fundamentally depends upon the searching of keyword in the list maintained by search engine. Text matching is done with the help of string matching algorithm. It is important to any string matching algorithm to locate quickly the occurrences of the user specified pattern in large text. In this paper a new string matching algorithm for keyword searching is proposed. The proposed algorithm relies on new technique based on pattern length and FML (First-Middle-Last) character match. This proposed algorithm is analysed and implemented. The extensive testing and comparisons are done with BoyerMoore, Naïve, Improved Naïve, Horspool and Zhu Takaoka. The result shows that the proposed algorithm takes less time than other existing algorithm. %@ 978-1-60558-994-7

@inproceedings{conf/etra/BeeldersB10, abstract = {The web has become a resourceful tool for almost all domains today. Search engines prominently use inverted indexing technique to locate the web pages having the users query. The performance of inverted index fundamentally depends upon the searching of keyword in the list maintained by search engine. Text matching is done with the help of string matching algorithm. It is important to any string matching algorithm to locate quickly the occurrences of the user specified pattern in large text. In this paper a new string matching algorithm for keyword searching is proposed. The proposed algorithm relies on new technique based on pattern length and FML (First-Middle-Last) character match. This proposed algorithm is analysed and implemented. The extensive testing and comparisons are done with BoyerMoore, Naïve, Improved Naïve, Horspool and Zhu Takaoka. The result shows that the proposed algorithm takes less time than other existing algorithm. }, added-at = {2018-12-21T06:07:02.000+0100}, author = {Arumugam, G. and M.Thangaraj and Sasirekha, R.}, biburl = {https://www.bibsonomy.org/bibtex/215f8507a3c11ac9015eeeb010002b4fa/ijcseit}, booktitle = {International Journal of Computer Science, Engineering and Information Technology (IJCSEIT)}, crossref = {conf/etra/2010}, editor = {Morimoto, Carlos Hitoshi and Istance, Howell O. and Hyrskykari, Aulikki and Ji, Qiang}, ee = {https://doi.org/10.1145/1743666.1743709}, interhash = {783fbe3d86df89f22b3c0815b8432aa2}, intrahash = {15f8507a3c11ac9015eeeb010002b4fa}, isbn = {978-1-60558-994-7}, issn = {2231-3117 [Online] ; 2231-3605 [Print]}, keywords = {IR String Syntactic Web matching searching}, language = {English}, month = apr, number = 1, pages = {09-19}, publisher = {ACM}, timestamp = {2018-12-21T06:07:02.000+0100}, title = {TEXT ANALYZER }, url = {http://airccse.org/journal/ijcseit/papers/0411cseit02.pdf}, volume = 1, year = 2011 }