Wiktionary
directed acyclic word graph
n. (context computing programming English) A data structure that represents a set of strings and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length (thus more efficient in some situations than a trie).
Wikipedia
Directed acyclic word graph
Directed acyclic word graph may refer to two related, but distinct, automata constructions in computer science:
- Deterministic acyclic finite state automaton, a data structure that represents a finite set of strings
- Suffix automaton, a finite automaton that functions as a suffix index