See semi-transitive on Wiktionary
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "semi-transitive (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"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": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"Such that there exists a finite vertex set so that for any vertex there exists another vertex in that finite set and an injective homomorphism of the graph that maps the second vertex to the first vertex."
],
"id": "en-semi-transitive-en-adj-WuL2C3Dk",
"links": [
[
"graph theory",
"graph theory"
],
[
"graph",
"graph"
],
[
"injective",
"injective"
],
[
"homomorphism",
"homomorphism"
]
],
"raw_glosses": [
"(graph theory, of a graph) Such that there exists a finite vertex set so that for any vertex there exists another vertex in that finite set and an injective homomorphism of the graph that maps the second vertex to the first vertex."
],
"raw_tags": [
"of a graph"
],
"related": [
{
"word": "transitive"
},
{
"word": "quasi-transitive"
}
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "semi-transitive"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "semi-transitive (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "transitive"
},
{
"word": "quasi-transitive"
}
],
"senses": [
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English uncomparable adjectives",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory"
],
"glosses": [
"Such that there exists a finite vertex set so that for any vertex there exists another vertex in that finite set and an injective homomorphism of the graph that maps the second vertex to the first vertex."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"graph",
"graph"
],
[
"injective",
"injective"
],
[
"homomorphism",
"homomorphism"
]
],
"raw_glosses": [
"(graph theory, of a graph) Such that there exists a finite vertex set so that for any vertex there exists another vertex in that finite set and an injective homomorphism of the graph that maps the second vertex to the first vertex."
],
"raw_tags": [
"of a graph"
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "semi-transitive"
}
Download raw JSONL data for semi-transitive meaning in All languages combined (1.2kB)
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.