Good point. It really depends on the size of the data set. If the size of the input data set m << dictionary data size n, it's a worth trying for caching. Oth

Good point. It really depends on the size of the data set. If the size of the input data set m << dictionary data size n, it's a worth trying for caching. Otherwise, the input word list should be loaded into LinkedList instead of ArrayList which is the most expensive list to be used when we need to access by its index number. Using Set will lose its order. (I'm just brainstorming the steps for discussion instead of writing code. I'd like to know the best solution and steps to improve it from you guys.)