I am currently storing a list of words (around 120,000) in a HashSet, for the purpose of using as a list to check enetered words against to see if they are spelt correctly,
You can also try Radix Tree(Wiki,Implementation) .This some what like trie but more memory efficient.