See SFT in All languages combined, or Wiktionary
{
"forms": [
{
"form": "SFTs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "SFT (plural SFTs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"alt_of": [
{
"word": "sparse Fourier transform"
}
],
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "38 34 28",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "35 49 16",
"kind": "topical",
"langcode": "en",
"name": "Functions",
"orig": "en:Functions",
"parents": [
"Algebra",
"Calculus",
"Geometry",
"Mathematical analysis",
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
}
],
"glosses": [
"Initialism of sparse Fourier transform."
],
"id": "en-SFT-en-noun-SVUGnW7Z",
"links": [
[
"mathematics",
"mathematics"
],
[
"sparse Fourier transform",
"w:sparse Fourier transform"
]
],
"raw_glosses": [
"(mathematics) Initialism of sparse Fourier transform."
],
"tags": [
"abbreviation",
"alt-of",
"initialism"
],
"topics": [
"mathematics",
"sciences"
]
},
{
"alt_of": [
{
"word": "supervised fine-tuning"
}
],
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Machine learning",
"orig": "en:Machine learning",
"parents": [
"Artificial intelligence",
"Computer science",
"Cybernetics",
"Computing",
"Sciences",
"Applied mathematics",
"Systems theory",
"Technology",
"All topics",
"Mathematics",
"Systems",
"Fundamental",
"Formal sciences",
"Interdisciplinary fields",
"Society"
],
"source": "w"
},
{
"_dis": "38 34 28",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "2024 February 2, David Rozado, “The Political Preferences of LLMs”, in Rozado’s Visual Analytics:",
"text": "I also show in the paper that LLMs are easily steerable into target locations of the political spectrum via supervised fine-tuning (SFT) requiring only modest compute and customized data, suggesting the critical role of SFT to imprint political preferences onto LLMs.",
"type": "quote"
}
],
"glosses": [
"Initialism of supervised fine-tuning."
],
"id": "en-SFT-en-noun-FqPpoWew",
"links": [
[
"machine learning",
"machine learning"
],
[
"supervise",
"supervise#English"
],
[
"fine-tuning",
"fine-tune#English"
]
],
"qualifier": "machine learning",
"raw_glosses": [
"(machine learning) Initialism of supervised fine-tuning."
],
"tags": [
"abbreviation",
"alt-of",
"initialism"
]
}
],
"word": "SFT"
}
{
"head_templates": [
{
"args": {},
"expansion": "SFT",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"alt_of": [
{
"extra": "the supreme court of Brazil",
"word": "Supreme Federal Tribunal"
}
],
"categories": [
{
"_dis": "38 34 28",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "43 27 31",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "41 32 27",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "88 9 3",
"kind": "place",
"langcode": "en",
"name": "Brazil",
"orig": "en:Brazil",
"parents": [
"South America",
"America",
"Earth",
"Nature",
"All topics",
"Fundamental"
],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "2016 March 17, Shasta Darlington and Flora Charner, “Brazil’s political intrigue: Ex-President Lula da Silva accepts Cabinet post”, in CNN:",
"text": "But under Brazilian law, senior political figures, including ministers and federal lawmakers, can only be tried in the Supreme Federal Tribunal. He could eventually face trial at the SFT, but the process would be dragged out.",
"type": "quote"
}
],
"glosses": [
"Initialism of Supreme Federal Tribunal, the supreme court of Brazil."
],
"id": "en-SFT-en-name-o0Pku~YP",
"links": [
[
"Supreme Federal Tribunal",
"w:Supreme Federal Tribunal"
],
[
"supreme court",
"supreme court"
],
[
"Brazil",
"Brazil"
]
],
"tags": [
"abbreviation",
"alt-of",
"initialism"
]
}
],
"word": "SFT"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English nouns",
"English proper nouns",
"English three-letter abbreviations",
"English uncountable nouns",
"English words without vowels",
"Pages with 1 entry",
"Pages with entries",
"en:Brazil",
"en:Functions"
],
"forms": [
{
"form": "SFTs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "SFT (plural SFTs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"alt_of": [
{
"word": "sparse Fourier transform"
}
],
"categories": [
"English initialisms",
"en:Mathematics"
],
"glosses": [
"Initialism of sparse Fourier transform."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"sparse Fourier transform",
"w:sparse Fourier transform"
]
],
"raw_glosses": [
"(mathematics) Initialism of sparse Fourier transform."
],
"tags": [
"abbreviation",
"alt-of",
"initialism"
],
"topics": [
"mathematics",
"sciences"
]
},
{
"alt_of": [
{
"word": "supervised fine-tuning"
}
],
"categories": [
"English initialisms",
"English terms with quotations",
"en:Machine learning"
],
"examples": [
{
"ref": "2024 February 2, David Rozado, “The Political Preferences of LLMs”, in Rozado’s Visual Analytics:",
"text": "I also show in the paper that LLMs are easily steerable into target locations of the political spectrum via supervised fine-tuning (SFT) requiring only modest compute and customized data, suggesting the critical role of SFT to imprint political preferences onto LLMs.",
"type": "quote"
}
],
"glosses": [
"Initialism of supervised fine-tuning."
],
"links": [
[
"machine learning",
"machine learning"
],
[
"supervise",
"supervise#English"
],
[
"fine-tuning",
"fine-tune#English"
]
],
"qualifier": "machine learning",
"raw_glosses": [
"(machine learning) Initialism of supervised fine-tuning."
],
"tags": [
"abbreviation",
"alt-of",
"initialism"
]
}
],
"word": "SFT"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English nouns",
"English proper nouns",
"English three-letter abbreviations",
"English uncountable nouns",
"English words without vowels",
"Pages with 1 entry",
"Pages with entries",
"en:Brazil",
"en:Functions"
],
"head_templates": [
{
"args": {},
"expansion": "SFT",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"alt_of": [
{
"extra": "the supreme court of Brazil",
"word": "Supreme Federal Tribunal"
}
],
"categories": [
"English initialisms",
"English terms with quotations"
],
"examples": [
{
"ref": "2016 March 17, Shasta Darlington and Flora Charner, “Brazil’s political intrigue: Ex-President Lula da Silva accepts Cabinet post”, in CNN:",
"text": "But under Brazilian law, senior political figures, including ministers and federal lawmakers, can only be tried in the Supreme Federal Tribunal. He could eventually face trial at the SFT, but the process would be dragged out.",
"type": "quote"
}
],
"glosses": [
"Initialism of Supreme Federal Tribunal, the supreme court of Brazil."
],
"links": [
[
"Supreme Federal Tribunal",
"w:Supreme Federal Tribunal"
],
[
"supreme court",
"supreme court"
],
[
"Brazil",
"Brazil"
]
],
"tags": [
"abbreviation",
"alt-of",
"initialism"
]
}
],
"word": "SFT"
}
Download raw JSONL data for SFT meaning in English (3.2kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-15 from the enwiktionary dump dated 2025-01-01 using wiktextract (b941637 and 4230888). 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.