See greatest in All languages combined, or Wiktionary
{
"categories": [
{
"kind": "other",
"name": "Formes d’adjectifs en anglais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Anglais",
"orig": "anglais",
"parents": [],
"source": "w"
}
],
"forms": [
{
"form": "great",
"ipas": [
"\\ˈɡɹeɪt\\"
],
"tags": [
"positive"
]
},
{
"form": "greater",
"ipas": [
"\\ˈɡɹeɪ.tɚ\\",
"\\ˈɡɹeɪ.tə\\"
],
"tags": [
"comparative"
]
}
],
"lang": "Anglais",
"lang_code": "en",
"pos": "adj",
"pos_title": "Forme d’adjectif",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "Adjectifs superlatifs en anglais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Exemples en anglais",
"parents": [],
"source": "w"
}
],
"examples": [
{
"bold_text_offsets": [
[
80,
88
]
],
"ref": "Ben Stephenson, The Python Workbook (2nde édition),Springer, 2019, page 133",
"text": "Write a program that implements Euclid's algorithm and uses it to determine the greatest common divisor of two integers entered by the user.",
"translation": "Écrivez un programme qui implémente l'algorithme d'Euclide et l'utilise pour déterminer le plus grand commun diviseur de deux entiers entrés par l'utilisateur."
}
],
"glosses": [
"Superlatif de great."
],
"id": "fr-greatest-en-adj-mORbgDCs"
}
],
"sounds": [
{
"ipa": "\\ˈɡɹeɪ.tɪst\\"
},
{
"ipa": "\\ˈɡɹeɪ.tɪst\\",
"raw_tags": [
"(Royaume-Uni)",
"(États-Unis)"
]
},
{
"audio": "En-us-greatest.ogg",
"ipa": "ˈɡɹeː.ɾɪst",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a9/En-us-greatest.ogg/En-us-greatest.ogg.mp3",
"ogg_url": "https://commons.wikimedia.org/wiki/Special:FilePath/En-us-greatest.ogg",
"raw_tags": [
"(Royaume-Uni)",
"(États-Unis)",
"États-Unis"
]
},
{
"ipa": "\\ˈɡɹæɪ.tɪst\\",
"raw_tags": [
"(Australie)"
]
},
{
"audio": "LL-Q1860 (eng)-Wodencafe-greatest.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_(eng)-Wodencafe-greatest.wav/LL-Q1860_(eng)-Wodencafe-greatest.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_(eng)-Wodencafe-greatest.wav/LL-Q1860_(eng)-Wodencafe-greatest.wav.ogg",
"raw_tags": [
"Texas (États-Unis)"
],
"wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q1860 (eng)-Wodencafe-greatest.wav"
},
{
"audio": "LL-Q1860 (eng)-Grendelkhan-greatest.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/e/e8/LL-Q1860_(eng)-Grendelkhan-greatest.wav/LL-Q1860_(eng)-Grendelkhan-greatest.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/e/e8/LL-Q1860_(eng)-Grendelkhan-greatest.wav/LL-Q1860_(eng)-Grendelkhan-greatest.wav.ogg",
"raw_tags": [
"Connecticut (États-Unis)"
],
"wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q1860 (eng)-Grendelkhan-greatest.wav"
}
],
"tags": [
"form-of"
],
"word": "greatest"
}
{
"categories": [
"Formes d’adjectifs en anglais",
"anglais"
],
"forms": [
{
"form": "great",
"ipas": [
"\\ˈɡɹeɪt\\"
],
"tags": [
"positive"
]
},
{
"form": "greater",
"ipas": [
"\\ˈɡɹeɪ.tɚ\\",
"\\ˈɡɹeɪ.tə\\"
],
"tags": [
"comparative"
]
}
],
"lang": "Anglais",
"lang_code": "en",
"pos": "adj",
"pos_title": "Forme d’adjectif",
"senses": [
{
"categories": [
"Adjectifs superlatifs en anglais",
"Exemples en anglais"
],
"examples": [
{
"bold_text_offsets": [
[
80,
88
]
],
"ref": "Ben Stephenson, The Python Workbook (2nde édition),Springer, 2019, page 133",
"text": "Write a program that implements Euclid's algorithm and uses it to determine the greatest common divisor of two integers entered by the user.",
"translation": "Écrivez un programme qui implémente l'algorithme d'Euclide et l'utilise pour déterminer le plus grand commun diviseur de deux entiers entrés par l'utilisateur."
}
],
"glosses": [
"Superlatif de great."
]
}
],
"sounds": [
{
"ipa": "\\ˈɡɹeɪ.tɪst\\"
},
{
"ipa": "\\ˈɡɹeɪ.tɪst\\",
"raw_tags": [
"(Royaume-Uni)",
"(États-Unis)"
]
},
{
"audio": "En-us-greatest.ogg",
"ipa": "ˈɡɹeː.ɾɪst",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a9/En-us-greatest.ogg/En-us-greatest.ogg.mp3",
"ogg_url": "https://commons.wikimedia.org/wiki/Special:FilePath/En-us-greatest.ogg",
"raw_tags": [
"(Royaume-Uni)",
"(États-Unis)",
"États-Unis"
]
},
{
"ipa": "\\ˈɡɹæɪ.tɪst\\",
"raw_tags": [
"(Australie)"
]
},
{
"audio": "LL-Q1860 (eng)-Wodencafe-greatest.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_(eng)-Wodencafe-greatest.wav/LL-Q1860_(eng)-Wodencafe-greatest.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_(eng)-Wodencafe-greatest.wav/LL-Q1860_(eng)-Wodencafe-greatest.wav.ogg",
"raw_tags": [
"Texas (États-Unis)"
],
"wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q1860 (eng)-Wodencafe-greatest.wav"
},
{
"audio": "LL-Q1860 (eng)-Grendelkhan-greatest.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/e/e8/LL-Q1860_(eng)-Grendelkhan-greatest.wav/LL-Q1860_(eng)-Grendelkhan-greatest.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/e/e8/LL-Q1860_(eng)-Grendelkhan-greatest.wav/LL-Q1860_(eng)-Grendelkhan-greatest.wav.ogg",
"raw_tags": [
"Connecticut (États-Unis)"
],
"wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q1860 (eng)-Grendelkhan-greatest.wav"
}
],
"tags": [
"form-of"
],
"word": "greatest"
}
Download raw JSONL data for greatest meaning in Anglais (2.5kB)
This page is a part of the kaikki.org machine-readable Anglais dictionary. This dictionary is based on structured data extracted on 2025-04-20 from the frwiktionary dump dated 2025-04-03 using wiktextract (87ad358 and ea19a0a). 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.