In my application I need to work with dictionary, what have a lot of words(110 000), so I decided to use trie, but loading of trie cost 9 seconds every time. And this is much a lot even for my emulator. Recently I have read about DAWG(Direct Acyclinc Word Graph) or Minimal Acyclinc Finite State Automaton DAWG wiki what will affect load performance but I can't find a good explanation of algorithm of creating DAWG or Trie to DAWG algorithm. Also I can't find any example, written on java, so I ask you for help. Thanks in advance
This may be a little too late for your needs, but for the sake of others who may find themselves here, have a look at MDAG, created and maintained by yours truly :) .