See Metropolis-Hastings algorithm on Wiktionary
{
"etymology_text": "Named after Nicholas Metropolis and W. K. Hastings.",
"forms": [
{
"form": "the Metropolis-Hastings algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Metropolis-Hastings algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"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": "Statistics",
"orig": "en:Statistics",
"parents": [
"Formal sciences",
"Mathematics",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult."
],
"id": "en-Metropolis-Hastings_algorithm-en-name-kxfhUZbC",
"links": [
[
"statistics",
"statistics"
],
[
"Markov chain",
"Markov chain"
],
[
"Monte Carlo method",
"Monte Carlo method"
],
[
"sequence",
"sequence"
],
[
"random",
"random"
],
[
"sample",
"sample"
],
[
"probability distribution",
"probability distribution"
],
[
"direct",
"direct"
]
],
"raw_glosses": [
"(statistics) A Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult."
],
"topics": [
"mathematics",
"sciences",
"statistics"
],
"wikipedia": [
"Metropolis-Hastings algorithm"
]
}
],
"word": "Metropolis-Hastings algorithm"
}
{
"etymology_text": "Named after Nicholas Metropolis and W. K. Hastings.",
"forms": [
{
"form": "the Metropolis-Hastings algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Metropolis-Hastings algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Statistics"
],
"glosses": [
"A Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult."
],
"links": [
[
"statistics",
"statistics"
],
[
"Markov chain",
"Markov chain"
],
[
"Monte Carlo method",
"Monte Carlo method"
],
[
"sequence",
"sequence"
],
[
"random",
"random"
],
[
"sample",
"sample"
],
[
"probability distribution",
"probability distribution"
],
[
"direct",
"direct"
]
],
"raw_glosses": [
"(statistics) A Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult."
],
"topics": [
"mathematics",
"sciences",
"statistics"
],
"wikipedia": [
"Metropolis-Hastings algorithm"
]
}
],
"word": "Metropolis-Hastings algorithm"
}
Download raw JSONL data for Metropolis-Hastings algorithm meaning in All languages combined (1.3kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.