Skip to main content
SpringerLink
Log in

Fast multiple keyword searching

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 644))

Included in the following conference series:

Abstract

A new multiple keyword searching algorithm is presented as a generalization of a fast substring matching algorithm based on an n-gram technique. The expected searching time complexity is shown to be O((N/m+ml) log lm) under reasonable assumptions about the keywords together with the assumption that the text is drawn from a stationary ergodic source, where N is the text size, l number of keywords and m the smallest keyword size.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho: Algorithms for finding patterns in strings, Handbook of theoretical computer science. Vol A edited by J.van Leewen (1990) Elsevier 257–300.

    Google Scholar 

  2. A.V. Aho and Margaret J. Corasick: Efficient String Matching: An Aid to Bibliographic Search. Comm. ACM 18 (1975) 330–340.

    Google Scholar 

  3. R.A. Baeza-Yates: Fast algorithms for two dimensional and multiple pattern matching. Springer-Verlag LNCS 447 SWAT90 332–347.

    Google Scholar 

  4. P. Billingsley: Ergodic Theory and Information. John Wiley and Sons 1965.

    Google Scholar 

  5. R.S. Boyer and J.S. Moore: A Fast String Searching Algorithm. Com. ACM 20 (1977) 762–772.

    Google Scholar 

  6. B. Commentz-Walter: A string matching algorithm fast on the average, Proc 6th international Colloquium on Automata, Languages and programming, Springer-Verlag (1979) 118–132.

    Google Scholar 

  7. R.N. Horspool: Practical fast searhing in strings. Software practice and experience 10 (1980) 501–506.

    Google Scholar 

  8. J.Y. Kim and J. Shawe-Taylor: An Approximate String Matching Algorithm. Theoretical Computer Science 92 (1992) 107–117.

    Google Scholar 

  9. J.Y. Kim and J. Shawe-Taylor: Fast Expected String Matching using an n-gram Algorithm. Departmental Technical Report CSD-TR-91-16.

    Google Scholar 

  10. D.E. Knuth, J.H. Morris and V.R. Pratt: Fast Pattern Matching in strings. SIAM. J. Comput. 6 (1977) 323–350.

    Google Scholar 

  11. J. Shawe-Taylor: Fast String Matching in a Stationary Ergodic Source. Departmental Technical Report CSD-TR-633.

    Google Scholar 

  12. J. Shawe-Taylor and J.Y. Kim: Fast Two dimensional Pattern Matching. Departmental Technical Report CSD-TR-91-25.

    Google Scholar 

  13. D. Welsh: Codes and Cryptography. Oxford University Press (1988).

    Google Scholar 

  14. S. Wu and U. Manber: Fast Text Searching With Errors. Department of Computer Science TR91-11 Arizona University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science Royal Holloway and Bedford New College, University of London, TW20 OEX, Egham, Surrey

    Jong Yong Kim & John Shawe-Taylor

Authors
  1. Jong Yong Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Shawe-Taylor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alberto Apostolico Maxime Crochemore Zvi Galil Udi Manber

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, J.Y., Shawe-Taylor, J. (1992). Fast multiple keyword searching. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds) Combinatorial Pattern Matching. CPM 1992. Lecture Notes in Computer Science, vol 644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56024-6_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-56024-6_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56024-1

  • Online ISBN: 978-3-540-47357-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation