This is a much easier problem as the input is large but streamable and the database is small.

However, you would still need to use some of the tokenisation steps that he talks about such as finding word boundaries and stemming.

The performance of your problem would be bounded by the size of your unseen text.

Something like the The Knuth-Morris-Pratt string-search algorithm would be useful.