See Robinson-Schensted correspondence on Wiktionary
{
"etymology_text": "Named after two mathematicians who worked in this area, Robinson (in 1938) and Schensted (1961).",
"forms": [
{
"form": "Robinson-Schensted correspondences",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Robinson-Schensted correspondence (plural Robinson-Schensted correspondences)",
"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": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has applications in combinatorics and other areas."
],
"id": "en-Robinson-Schensted_correspondence-en-noun-3c~ARJhg",
"links": [
[
"mathematics",
"mathematics"
],
[
"bijective",
"bijective"
],
[
"correspondence",
"correspondence"
],
[
"permutation",
"permutation"
],
[
"pair",
"pair"
],
[
"Young tableau",
"Young tableau"
],
[
"combinatorics",
"combinatorics"
]
],
"raw_glosses": [
"(mathematics) A bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has applications in combinatorics and other areas."
],
"related": [
{
"word": "Schensted algorithm"
},
{
"word": "Schensted insertion"
}
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"Robinson-Schensted correspondence"
]
}
],
"word": "Robinson-Schensted correspondence"
}
{
"etymology_text": "Named after two mathematicians who worked in this area, Robinson (in 1938) and Schensted (1961).",
"forms": [
{
"form": "Robinson-Schensted correspondences",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Robinson-Schensted correspondence (plural Robinson-Schensted correspondences)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "Schensted algorithm"
},
{
"word": "Schensted insertion"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Mathematics"
],
"glosses": [
"A bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has applications in combinatorics and other areas."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"bijective",
"bijective"
],
[
"correspondence",
"correspondence"
],
[
"permutation",
"permutation"
],
[
"pair",
"pair"
],
[
"Young tableau",
"Young tableau"
],
[
"combinatorics",
"combinatorics"
]
],
"raw_glosses": [
"(mathematics) A bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has applications in combinatorics and other areas."
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"Robinson-Schensted correspondence"
]
}
],
"word": "Robinson-Schensted correspondence"
}
Download raw JSONL data for Robinson-Schensted correspondence meaning in All languages combined (1.4kB)
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.