Hi, I have a question regarding the Concurrent Inverted Radix Tree.

I am using this library to detect profanity in text. 
Does the Concurrent Inverted Radix Tree use the Aho-Corasick algorithm to search for keywords in external documents? 

Could you explain how the time complexity is O(d log(k))?