"directed acyclic word graph" meaning in English

{
  "forms": [
    {
      "form": "directed acyclic word graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "directed acyclic word graph (plural directed acyclic word graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Programming",
          "orig": "en:Programming",
          "parents": [
            "Computing",
            "Software engineering",
            "Technology",
            "Computer science",
            "Engineering",
            "Software",
            "All topics",
            "Sciences",
            "Applied sciences",
            "Media",
            "Fundamental",
            "Communication"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "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)."
      ],
      "id": "en-directed_acyclic_word_graph-en-noun-2mWTJKEv",
      "links": [
        [
          "programming",
          "programming#Noun"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "string",
          "string"
        ],
        [
          "query",
          "query"
        ],
        [
          "trie",
          "trie"
        ]
      ],
      "raw_glosses": [
        "(programming) 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)."
      ],
      "synonyms": [
        {
          "word": "DAWG"
        }
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "programming",
        "sciences"
      ]
    }
  ],
  "word": "directed acyclic word graph"
}

{
  "forms": [
    {
      "form": "directed acyclic word graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "directed acyclic word graph (plural directed acyclic word graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Translation table header lacks gloss",
        "en:Programming"
      ],
      "glosses": [
        "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)."
      ],
      "links": [
        [
          "programming",
          "programming#Noun"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "string",
          "string"
        ],
        [
          "query",
          "query"
        ],
        [
          "trie",
          "trie"
        ]
      ],
      "raw_glosses": [
        "(programming) 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)."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "programming",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "DAWG"
    }
  ],
  "word": "directed acyclic word graph"
}