Speed and accuracy is everything in Natural Language Processing (NLP). Some decide to go a “pure” Deep Learning route, but even when going in that direction, there are many situations in which you need a fast text searcher. Sometimes you just are looking for, say, 10000 words in [bm]illions of texts (the more, the higher the relative gain compared to regex).

One of the libraries existing for that is flashtext. I suggest you read the article written by my friend Vikash Singh called “Regex was taking 5 days to run. So I built a tool that did it in 15 minutes”. I’m proud to have raised issues to his library, and he was very patient and he kept making it the awesome package that it is.

That said, I wanted to take the lessons learned there, and make a library having more options. At the same time, I realized that he adapted the popular aho-corasick algorithm (historically what grep was built on!). Instead, I found out someone had written an aho-corasick implementation in C with a python wrapper on top (called pyahocorasick) - I went from there.

textsearch was born.

Introducing textsearch

The goal of textsearch is to be the fastest when you need to quickly search and find multiple strings (and sometimes still some regex). The trick to these algorithms is that regardless of how many words you are looking for, you only loop once over the text you are searching. This is what makes it efficient. In case you’re interested, read about trie data structures and the aho-corasick algorithm in particular.

Currently I am in the process of rewriting many packages to use this instead of regex (all having roughly a 30x speedup over the current code that’s regex based):

contractions: Fixes contractions such as you're to you are

to you metadate: Finding dates in natural text

natura: Find currencies / money in natural text as python objects

rebrand: Refactor software using smart-cased string replacement

I am also writing a tokenizer - one that is at least 20x faster than any tokenizer I’ve seen in Python (nltk, spacy, segtok) and is much more configurable in a straight-forward manner!

I hope you will find it as fun to create modules / apps on top of this! If you want you can let me know and I will make sure to list your package here https://github.com/kootenpv/textsearch#showcase

Basic usage example

from textsearch import TextSearch ts = TextSearch ( case = "ignore" , returns = "match" ) words = [ "hi" , "bye" ] ts . add ( words ) ts . findall ( "hi Pascal, bye" ) # ["hi", "bye"]

For more, please have a look (perhaps even check out ;-)) the github repository kootenpv/textsearch.

I’ll be posting benchmarks eventually, but in running benchmarks of a similar implementation in Go, textsearch had a comparable speed, and at the same time was more configurable. It’s also way faster (once you add the fancier options) than the equivalent in Java. Compared to flashtext it changed from being 30% to 300% faster.