algorithm - How to construct a DAWG from a trie? -


i construct trie vocabulary, , found there many branches shared same struct. want combine them result dawg.

what algorithm use convert trie dawg?

the standard algorithm converting trie dawg works treating trie deterministic finite automaton, converting trie minimum-state dfa.

there many algorithms performing conversion. algorithm i'm familiar hopcroft's algorithm, works finding pairs of distinguishable states , combining indistinguishable states together.

hope helps!


Comments

Popular posts from this blog

monitor web browser programmatically in Android? -

Shrink a YouTube video to responsive width -

wpf - PdfWriter.GetInstance throws System.NullReferenceException -