I am trying to implement a little game with the following rules: Given a set of random letters (e.g. 10), I want to find all possible words one can fo ...

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 method ...

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 ever ...

I would like to implement a string look-up data structure, for dynamic strings, that will support efficient search and insertion. Currently, I am usin ...

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 ...

I am currently looking into DAWGs and I haven't been able to find one good way of constructing an acyclic automaton. So basically, what I want to do ...

dawgdic is a great DAWG library, but it has a significant drawback because it is static (not updateable) and has to be constructed form strings sorted ...

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 ser ...

I need to be able to quickly check if a given word is in my dictionary (English wordlist). I'm only concerned with speed of checking membership (not a ...

Can a DAWG be used to store auxiliary information relating to each path, e.g. a word's frequency in the English language? If yes, then how can i do th ...

I'm interested in tries and DAWGs (direct acyclic word graph) and I've been reading a lot about them but I don't understand what should the output tri ...