Assertion: acyclic graph | /r/CapableOf | save space
Facets:
value: over a trie
type: OTHER
Source sentences:
text: A directed acyclic word graph saves space over a trie by allowing paths to diverge and rejoin, so that a set of words with the same possible suffixes can be represented by a single tree vertex.