- The model of a text collection as a string, with
various grammars or structures superimposed for reference
purposes, is an important contribution made by those who
have worked with PAT.
- Prefix, pattern, frequency, repetition, and range type
questions are some places where Patricia trees excel.
- String searching speed will vary quite widely depending on the
algorithm chosen. Some are tuned for average case, and some for worst
case.
- String searching can be speeded up by pre-processing the
pattern so that it can ``jump-ahead'' to the best place for resuming
search after a mismatch.
- If one knows roughly how many matches there are for a pattern,
that could be considered too in selecting an algorithm.