See alist in All languages combined, or Wiktionary
{
"categories": [
{
"kind": "other",
"name": "Lemmes en anglais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Noms communs en anglais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Anglais",
"orig": "anglais",
"parents": [],
"source": "w"
}
],
"etymology_texts": [
"Contraction de association list utilisée dans LISP."
],
"forms": [
{
"form": "alists",
"ipas": [
"\\ˈeɪ.ˌlɪsts\\"
],
"tags": [
"plural"
]
}
],
"lang": "Anglais",
"lang_code": "en",
"pos": "noun",
"pos_title": "Nom commun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "Exemples en anglais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Exemples en anglais à traduire",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Lexique en anglais de la programmation",
"parents": [],
"source": "w"
}
],
"examples": [
{
"ref": "J. S. Moore et Q. Zhang, Proof Pearl: Dijkstra’s Shortest Path Algorithm Verified with ACL2, dans Joe Hurd et Tom F. Melham (éds), Theorem proving in higher order logics: 18th international conference, 2005, p. 375",
"text": "We use alists extensively in this work. A directed graph is an alist associating vertices with edge lists."
}
],
"glosses": [
"Liste d’association."
],
"id": "fr-alist-en-noun-E-WOie0I",
"topics": [
"programming"
]
}
],
"sounds": [
{
"ipa": "\\ˈeɪ.ˌlɪst\\"
}
],
"synonyms": [
{
"word": "association list"
}
],
"word": "alist"
}
{
"categories": [
"Lemmes en anglais",
"Noms communs en anglais",
"anglais"
],
"etymology_texts": [
"Contraction de association list utilisée dans LISP."
],
"forms": [
{
"form": "alists",
"ipas": [
"\\ˈeɪ.ˌlɪsts\\"
],
"tags": [
"plural"
]
}
],
"lang": "Anglais",
"lang_code": "en",
"pos": "noun",
"pos_title": "Nom commun",
"senses": [
{
"categories": [
"Exemples en anglais",
"Exemples en anglais à traduire",
"Lexique en anglais de la programmation"
],
"examples": [
{
"ref": "J. S. Moore et Q. Zhang, Proof Pearl: Dijkstra’s Shortest Path Algorithm Verified with ACL2, dans Joe Hurd et Tom F. Melham (éds), Theorem proving in higher order logics: 18th international conference, 2005, p. 375",
"text": "We use alists extensively in this work. A directed graph is an alist associating vertices with edge lists."
}
],
"glosses": [
"Liste d’association."
],
"topics": [
"programming"
]
}
],
"sounds": [
{
"ipa": "\\ˈeɪ.ˌlɪst\\"
}
],
"synonyms": [
{
"word": "association list"
}
],
"word": "alist"
}
Download raw JSONL data for alist meaning in Anglais (1.0kB)
This page is a part of the kaikki.org machine-readable Anglais dictionary. This dictionary is based on structured data extracted on 2025-01-22 from the frwiktionary dump dated 2025-01-20 using wiktextract (0c0c1f1 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.