"directed acyclic word graph" meaning in English

See directed acyclic word graph in All languages combined, or Wiktionary

Noun

Forms: directed acyclic word graphs [plural]
Head templates: {{en-noun}} directed acyclic word graph (plural directed acyclic word graphs)
  1. (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). Categories (topical): Programming Synonyms: DAWG
    Sense id: en-directed_acyclic_word_graph-en-noun-2mWTJKEv Categories (other): English entries with incorrect language header Topics: computing, engineering, mathematics, natural-sciences, physical-sciences, programming, sciences

Inflected forms

Alternative forms

Download JSON data for directed acyclic word graph meaning in English (1.6kB)

{
  "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": "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",
        "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"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-04-30 from the enwiktionary dump dated 2024-04-21 using wiktextract (210104c and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.