A DAWG (directed acyclic word graph) is a data structure for storing a set of strings. It can be thought of as a compressed trie, or as a minimum-state finite automaton for the given set of strings.
Questions tagged [dawg]
18 questions
0
votes
2 answers
How to find what version of dawg I have?
How can I find what version of dwag I have installed in python? Usually packagename.version does the trick, but dawg seems to lack the relevant methods.
Everyone_Else
- 3,206
- 4
- 32
- 55
0
votes
2 answers
I need to store '/' separated strings in a tree-like structure in C#, how should I do it?
I am trying to store the parts of a long string in an efficient tree-like structure, I have searched but most of the implementations are for searching within words... let me try to explain what I mean with an example, if I…
juanlu
- 398
- 1
- 3
- 12
0
votes
1 answer
Saving a DAWG in java
I'm looking to create a DAWG structure to validate words entered by a user. This is going to be used in an Android App. Would my best option be to serialize a DAWG structure outside the app then load it upon the start? Or is there a better way to…
Matt Stokes
- 4,618
- 9
- 33
- 56