A Fast Sentence Searching Algorithm

作者: Rohit Kamal Saxena , Kamlendra Pratap Singh , U. C. Jaiswal

DOI: 10.1007/978-3-642-19542-6_109

关键词:

摘要: With ever increasing digital data in form of files, there is a need efficient text searching algorithms with their applications. This paper describes an algorithm for any sentence the given pool files. The efficiency depends on fact about sentences language that, can be no such condition where may part some similar (as case patterns). Keeping this property languages mind, we are presenting linear order search preprocessing time.

参考文章(4)
Richard M. Karp, Michael O. Rabin, Efficient randomized pattern-matching algorithms Ibm Journal of Research and Development. ,vol. 31, pp. 249- 260 ,(1987) , 10.1147/RD.312.0249
Daniel M. Sunday, A very fast substring search algorithm Communications of the ACM. ,vol. 33, pp. 132- 142 ,(1990) , 10.1145/79173.79184
Robert S. Boyer, J. Strother Moore, A fast string searching algorithm Communications of the ACM. ,vol. 20, pp. 762- 772 ,(1977) , 10.1145/359842.359859
M.Komp, Adhi Harmoko S, Joseph Marie Jacquard, Eniac, Konrad Zuse, Introduction to Algorithms ,(2005)