Efficient String Matching: An Aid to Bibliographic Search

@article{Aho1975EfficientSM,
  title={Efficient String Matching: An Aid to Bibliographic Search},
  author={Alfred V. Aho and Margaret J. Corasick},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={333-340}
}
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching machine takes time proportional to the sum of the lengths of the keywords. The number of state transitions made by the pattern matching… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

Similar Papers

Loading similar papers…