See superconnected in All languages combined, or Wiktionary
Download JSON data for superconnected meaning in English (2.6kB)
{ "etymology_templates": [ { "args": { "1": "en", "2": "super", "3": "connected" }, "expansion": "super- + connected", "name": "prefix" } ], "etymology_text": "super- + connected", "forms": [ { "form": "more superconnected", "tags": [ "comparative" ] }, { "form": "most superconnected", "tags": [ "superlative" ] } ], "head_templates": [ { "args": {}, "expansion": "superconnected (comparative more superconnected, superlative most superconnected)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ { "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" }, { "_dis": "47 53", "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w+disamb" }, { "_dis": "54 46", "kind": "other", "name": "English terms prefixed with super-", "parents": [], "source": "w+disamb" } ], "examples": [ { "ref": "2003, H. L. Bodlaender, Graph-theoretic concepts in computer science: 29th International Workshop", "text": "For a superconnected probe interval graph G, a tree 4-spanner can be constructed easily.", "type": "quotation" } ], "glosses": [ "Whose every minimum vertex cut leads to isolated vertices." ], "id": "en-superconnected-en-adj-hVWiVeJr", "links": [ [ "graph theory", "graph theory" ], [ "minimum", "minimum" ], [ "vertex", "vertex" ], [ "cut", "cut" ] ], "raw_glosses": [ "(graph theory, of a graph) Whose every minimum vertex cut leads to isolated vertices." ], "raw_tags": [ "of a graph" ], "topics": [ "graph-theory", "mathematics", "sciences" ] }, { "categories": [ { "_dis": "47 53", "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w+disamb" }, { "_dis": "54 46", "kind": "other", "name": "English terms prefixed with super-", "parents": [], "source": "w+disamb" } ], "examples": [ { "ref": "2007 February 17, Paul B. Brown, “Wireless Codependency”, in New York Times", "text": "The superconnected may develop a dual-dependency,” Robert Bornstein, a psychologist at Adelphi University, told the author of the article, Carlin Flora.", "type": "quotation" } ], "glosses": [ "Being a major user of communication technologies." ], "id": "en-superconnected-en-adj-sUhzEjpr", "links": [ [ "communication", "communication" ], [ "technologies", "technology" ] ], "raw_glosses": [ "(informal) Being a major user of communication technologies." ], "tags": [ "informal" ] } ], "word": "superconnected" }
{ "categories": [ "English adjectives", "English entries with incorrect language header", "English lemmas", "English terms prefixed with super-" ], "etymology_templates": [ { "args": { "1": "en", "2": "super", "3": "connected" }, "expansion": "super- + connected", "name": "prefix" } ], "etymology_text": "super- + connected", "forms": [ { "form": "more superconnected", "tags": [ "comparative" ] }, { "form": "most superconnected", "tags": [ "superlative" ] } ], "head_templates": [ { "args": {}, "expansion": "superconnected (comparative more superconnected, superlative most superconnected)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ "English terms with quotations", "Quotation templates to be cleaned", "en:Graph theory" ], "examples": [ { "ref": "2003, H. L. Bodlaender, Graph-theoretic concepts in computer science: 29th International Workshop", "text": "For a superconnected probe interval graph G, a tree 4-spanner can be constructed easily.", "type": "quotation" } ], "glosses": [ "Whose every minimum vertex cut leads to isolated vertices." ], "links": [ [ "graph theory", "graph theory" ], [ "minimum", "minimum" ], [ "vertex", "vertex" ], [ "cut", "cut" ] ], "raw_glosses": [ "(graph theory, of a graph) Whose every minimum vertex cut leads to isolated vertices." ], "raw_tags": [ "of a graph" ], "topics": [ "graph-theory", "mathematics", "sciences" ] }, { "categories": [ "English informal terms", "English terms with quotations" ], "examples": [ { "ref": "2007 February 17, Paul B. Brown, “Wireless Codependency”, in New York Times", "text": "The superconnected may develop a dual-dependency,” Robert Bornstein, a psychologist at Adelphi University, told the author of the article, Carlin Flora.", "type": "quotation" } ], "glosses": [ "Being a major user of communication technologies." ], "links": [ [ "communication", "communication" ], [ "technologies", "technology" ] ], "raw_glosses": [ "(informal) Being a major user of communication technologies." ], "tags": [ "informal" ] } ], "word": "superconnected" }
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-06 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.