Question

Assuming i have 3 words in my DAWG: do, dot, bot i will have this:

http://imageshack.us/photo/my-images/703/dawgp.png/

This graph tells that ‘bo’ is also a word. Which indeed not. Node ‘o’ is EOW if only path comes from ‘d’, not ‘b’

I obviously miss smth but i do now know what.

Answer 1

OK, I think I understand a bit better what you are trying to do and how a DAG fits into your work. If you want a graph to represent the dictionary containing the words ‘do’, ‘dot’ and ‘bot’ you would have the edges;

.->d->o'->t'
.->b->o->t'

where ‘.’ represents the root of your graph and the branches are entirely separate, that is the edge ‘d->o’ points to a different occurrence of ‘o’ from the one referred to in ‘b->o’. By trying to have both edges point to the same occurrence of ‘o’ you’ve malformed the graph.

Note that in my ‘graph’ I’ve used a ‘ symbol to indicate that a letter can be the end of a word by reading from the root to that symbol. If I have time later I’ll do a better picture of the graph.