See SAT in All languages combined, or Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "mul",
"2": "w:Boolean satisfiability problem"
},
"expansion": "Abbreviation of Boolean satisfiability problem",
"name": "abbrev"
}
],
"etymology_text": "Abbreviation of Boolean satisfiability problem.",
"head_templates": [
{
"args": {
"1": "Latn"
},
"expansion": "Latn",
"name": "mul-symbol/script"
},
{
"args": {
"1": "mul",
"10": "",
"2": "symbol",
"3": "",
"4": "",
"5": "or",
"6": "",
"7": "or",
"8": "",
"9": "or",
"cat2": "",
"f1lang": "en",
"f1nolink": "",
"f2lang": "en",
"f2nolink": "",
"f3lang": "en",
"f3nolink": "",
"f4lang": "en",
"f4nolink": "",
"head": "",
"head2": "",
"head3": "",
"head4": "",
"nolinkhead": "",
"sc": "Latn",
"sort": ""
},
"expansion": "SAT",
"name": "head"
},
{
"args": {},
"expansion": "SAT",
"name": "mul-symbol"
}
],
"lang": "Translingual",
"lang_code": "mul",
"pos": "symbol",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "Pages with 2 entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Translingual entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Translingual links with redundant alt parameters",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Translingual links with redundant wikilinks",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Translingual terms with redundant script codes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "mul",
"name": "Theory of computing",
"orig": "mul:Theory of computing",
"parents": [],
"source": "w"
},
{
"_dis": "1 21 29 14 37",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "1 11 18 6 64",
"kind": "other",
"name": "Pages with 2 entries",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "0 16 24 4 55",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
],
"id": "en-SAT-mul-symbol-GCRzBWcL",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"decision problem",
"decision problem"
],
[
"Boolean",
"Boolean"
],
[
"formula",
"formula"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "SAT"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English pseudo-acronyms",
"English uncountable nouns",
"Pages with 2 entries",
"Pages with entries",
"Rhymes:English/iː",
"Rhymes:English/iː/3 syllables",
"Rhymes:English/æt",
"Rhymes:English/æt/1 syllable"
],
"etymology_templates": [
{
"args": {
"1": "mul",
"2": "w:Boolean satisfiability problem"
},
"expansion": "Abbreviation of Boolean satisfiability problem",
"name": "abbrev"
}
],
"etymology_text": "Abbreviation of Boolean satisfiability problem.",
"head_templates": [
{
"args": {
"1": "Latn"
},
"expansion": "Latn",
"name": "mul-symbol/script"
},
{
"args": {
"1": "mul",
"10": "",
"2": "symbol",
"3": "",
"4": "",
"5": "or",
"6": "",
"7": "or",
"8": "",
"9": "or",
"cat2": "",
"f1lang": "en",
"f1nolink": "",
"f2lang": "en",
"f2nolink": "",
"f3lang": "en",
"f3nolink": "",
"f4lang": "en",
"f4nolink": "",
"head": "",
"head2": "",
"head3": "",
"head4": "",
"nolinkhead": "",
"sc": "Latn",
"sort": ""
},
"expansion": "SAT",
"name": "head"
},
{
"args": {},
"expansion": "SAT",
"name": "mul-symbol"
}
],
"lang": "Translingual",
"lang_code": "mul",
"pos": "symbol",
"senses": [
{
"categories": [
"Pages with 2 entries",
"Pages with entries",
"Translingual abbreviations",
"Translingual entries with incorrect language header",
"Translingual lemmas",
"Translingual links with redundant alt parameters",
"Translingual links with redundant wikilinks",
"Translingual symbols",
"Translingual terms with redundant script codes",
"mul:Theory of computing"
],
"glosses": [
"The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"decision problem",
"decision problem"
],
[
"Boolean",
"Boolean"
],
[
"formula",
"formula"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "SAT"
}
Download raw JSONL data for SAT meaning in Translingual (2.2kB)
This page is a part of the kaikki.org machine-readable Translingual dictionary. This dictionary is based on structured data extracted on 2025-07-20 from the enwiktionary dump dated 2025-07-01 using wiktextract (45c4a21 and f1c2b61). 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.