How to construct a DAWG from a trie?
问题 i just construct a trie for a vocabulary, and then I found that there are many branches shared the same struct. i want to combine them together result to be a DAWG. What algorithm would I use to convert a trie to a DAWG? 回答1: The standard algorithm for converting a trie into a DAWG works by treating the trie as a deterministic finite automaton, then converting the trie into a minimum-state DFA. There are many algorithms for performing this conversion. The algorithm I'm most familiar with is