Locale-Insensitive Fixed Pattern Matching in stringi
String searching facilities described in this very man page
provide a way to locate a specific sequence of bytes in a string.
Fixed pattern search engine's settings may be tuned up (for example
to perform case-insensitive search), see the
stri_opts_fixed function for more details.
The Knuth-Morris-Pratt search algorithm, with worst time complexity of
n == length(str),
p == length(pattern))
is utilized (with some tweaks for very short search patterns).
For natural language processing, however, this is not what
you probably want. It is because a bitwise match will
not give correct results in cases of:
see also stringi-search-coll.
Note that the conversion of input data to Unicode is done as usual.