What's the memory consumption like? A node for each letter seems like it would result in substantial memory consumption. I was thinking an object pool might help here, but I'm not sure if its possible to use it given the nesting of the nodes

Also, if the library removes stop words, does that mean its limited in which languages it supports? I'm assuming only English stop words are filtered

Not being critical here, just genuinely curious and don't have time to look through the code ATM