"self-balancing" meaning in English

See self-balancing in All languages combined, or Wiktionary

Adjective

Etymology: self- + balancing Etymology templates: {{prefix|en|self|balancing}} self- + balancing Head templates: {{en-adj|-}} self-balancing (not comparable)
  1. Able to right itself automatically to prevent falling. Tags: not-comparable
    Sense id: en-self-balancing-en-adj-wZR9HQvq Categories (other): English terms prefixed with self- Disambiguation of English terms prefixed with self-: 49 51
  2. (computing theory) Of a data structure: able to maintain a small height (number of levels) regardless of insertions and deletions. Tags: not-comparable Categories (topical): Theory of computing
    Sense id: en-self-balancing-en-adj-Jq0uHe2s Categories (other): English entries with incorrect language header, English terms prefixed with self- Disambiguation of English entries with incorrect language header: 24 76 Disambiguation of English terms prefixed with self-: 49 51 Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences

Download JSON data for self-balancing meaning in English (2.0kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "self",
        "3": "balancing"
      },
      "expansion": "self- + balancing",
      "name": "prefix"
    }
  ],
  "etymology_text": "self- + balancing",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "self-balancing (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "_dis": "49 51",
          "kind": "other",
          "name": "English terms prefixed with self-",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "text": "a self-balancing scooter"
        },
        {
          "text": "a self-balancing unicycle"
        }
      ],
      "glosses": [
        "Able to right itself automatically to prevent falling."
      ],
      "id": "en-self-balancing-en-adj-wZR9HQvq",
      "links": [
        [
          "right",
          "right"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "24 76",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "49 51",
          "kind": "other",
          "name": "English terms prefixed with self-",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "text": "a self-balancing binary search tree"
        }
      ],
      "glosses": [
        "Of a data structure: able to maintain a small height (number of levels) regardless of insertions and deletions."
      ],
      "id": "en-self-balancing-en-adj-Jq0uHe2s",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "height",
          "height"
        ],
        [
          "level",
          "level"
        ],
        [
          "insertion",
          "insertion"
        ],
        [
          "deletion",
          "deletion"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Of a data structure: able to maintain a small height (number of levels) regardless of insertions and deletions."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "self-balancing"
}
{
  "categories": [
    "English adjectives",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English terms prefixed with self-",
    "English uncomparable adjectives"
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "self",
        "3": "balancing"
      },
      "expansion": "self- + balancing",
      "name": "prefix"
    }
  ],
  "etymology_text": "self- + balancing",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "self-balancing (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "examples": [
        {
          "text": "a self-balancing scooter"
        },
        {
          "text": "a self-balancing unicycle"
        }
      ],
      "glosses": [
        "Able to right itself automatically to prevent falling."
      ],
      "links": [
        [
          "right",
          "right"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    },
    {
      "categories": [
        "en:Theory of computing"
      ],
      "examples": [
        {
          "text": "a self-balancing binary search tree"
        }
      ],
      "glosses": [
        "Of a data structure: able to maintain a small height (number of levels) regardless of insertions and deletions."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "height",
          "height"
        ],
        [
          "level",
          "level"
        ],
        [
          "insertion",
          "insertion"
        ],
        [
          "deletion",
          "deletion"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Of a data structure: able to maintain a small height (number of levels) regardless of insertions and deletions."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "self-balancing"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-27 from the enwiktionary dump dated 2024-05-02 using wiktextract (bb24e0f and c7ea76d). 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.