So what would be the algorithm for matching partial words then?
I have the code that iterates through index nodes to search for a word
done, but how do I match partial words?
I see no other way but to iterate through all the leaf nodes, and that
sucks because it screws up the whole algorithm architecture that I had
in mind. I can live without case sensitive, but no more "Whole words