"A*" meaning in English

See A* in All languages combined, or Wiktionary

Noun

IPA: /eɪ̯ stɑː/ Audio: en-us-a-star.ogg Forms: A*'s [plural], A*s [plural]
Head templates: {{en-noun|A*'s|s|head=A*}} A* (plural A*'s or A*s)
  1. An academic grade, higher than A or A+. Where it is used, it is often the best class of result. Categories (topical): Academic grades
    Sense id: en-A*-en-noun-XygkCQfr Disambiguation of Academic grades: 94 6
  2. (computer science) A best-first graph search algorithm for finding a lowest-cost path to a goal. Categories (topical): Computer science
    Sense id: en-A*-en-noun-9RAuh2gz Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Disambiguation of English entries with incorrect language header: 14 86 Disambiguation of Pages with 1 entry: 16 84 Disambiguation of Pages with entries: 11 89 Topics: computer, computing, engineering, mathematics, natural-sciences, physical-sciences, science, sciences
The following are not (yet) sense-disambiguated
Related terms: A+

Inflected forms

Alternative forms

{
  "forms": [
    {
      "form": "A*'s",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "A*s",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "A*'s",
        "2": "s",
        "head": "A*"
      },
      "expansion": "A* (plural A*'s or A*s)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "_dis1": "0 0",
      "word": "A+"
    }
  ],
  "senses": [
    {
      "categories": [
        {
          "_dis": "94 6",
          "kind": "topical",
          "langcode": "en",
          "name": "Academic grades",
          "orig": "en:Academic grades",
          "parents": [
            "Education",
            "Society",
            "All topics",
            "Fundamental"
          ],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "An academic grade, higher than A or A+. Where it is used, it is often the best class of result."
      ],
      "id": "en-A*-en-noun-XygkCQfr",
      "links": [
        [
          "academic",
          "academic"
        ],
        [
          "grade",
          "grade"
        ],
        [
          "A",
          "A"
        ],
        [
          "A+",
          "A+"
        ],
        [
          "best",
          "best"
        ],
        [
          "class",
          "class"
        ],
        [
          "result",
          "result"
        ]
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "14 86",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "16 84",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "11 89",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "A best-first graph search algorithm for finding a lowest-cost path to a goal."
      ],
      "id": "en-A*-en-noun-9RAuh2gz",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "search",
          "search"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computer science) A best-first graph search algorithm for finding a lowest-cost path to a goal."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/eɪ̯ stɑː/"
    },
    {
      "audio": "en-us-a-star.ogg",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/55/En-us-a-star.ogg/En-us-a-star.ogg.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/5/55/En-us-a-star.ogg"
    }
  ],
  "wikipedia": [
    "A* search algorithm"
  ],
  "word": "A*"
}
{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English nouns",
    "English nouns with irregular plurals",
    "English terms spelled with *",
    "Pages with 1 entry",
    "Pages with entries",
    "en:Academic grades"
  ],
  "forms": [
    {
      "form": "A*'s",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "A*s",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "A*'s",
        "2": "s",
        "head": "A*"
      },
      "expansion": "A* (plural A*'s or A*s)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "A+"
    }
  ],
  "senses": [
    {
      "glosses": [
        "An academic grade, higher than A or A+. Where it is used, it is often the best class of result."
      ],
      "links": [
        [
          "academic",
          "academic"
        ],
        [
          "grade",
          "grade"
        ],
        [
          "A",
          "A"
        ],
        [
          "A+",
          "A+"
        ],
        [
          "best",
          "best"
        ],
        [
          "class",
          "class"
        ],
        [
          "result",
          "result"
        ]
      ]
    },
    {
      "categories": [
        "en:Computer science"
      ],
      "glosses": [
        "A best-first graph search algorithm for finding a lowest-cost path to a goal."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "search",
          "search"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computer science) A best-first graph search algorithm for finding a lowest-cost path to a goal."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/eɪ̯ stɑː/"
    },
    {
      "audio": "en-us-a-star.ogg",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/55/En-us-a-star.ogg/En-us-a-star.ogg.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/5/55/En-us-a-star.ogg"
    }
  ],
  "wikipedia": [
    "A* search algorithm"
  ],
  "word": "A*"
}

Download raw JSONL data for A* meaning in English (1.6kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.