See preorder in All languages combined, or Wiktionary
Download JSON data for preorder meaning in English (8.7kB)
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "pre",
"3": "order"
},
"expansion": "pre- + order",
"name": "prefix"
}
],
"etymology_text": "pre- + order.",
"forms": [
{
"form": "preorders",
"tags": [
"present",
"singular",
"third-person"
]
},
{
"form": "preordering",
"tags": [
"participle",
"present"
]
},
{
"form": "preordered",
"tags": [
"participle",
"past"
]
},
{
"form": "preordered",
"tags": [
"past"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "preorder (third-person singular simple present preorders, present participle preordering, simple past and past participle preordered)",
"name": "en-verb"
}
],
"lang": "English",
"lang_code": "en",
"pos": "verb",
"senses": [
{
"categories": [
{
"_dis": "16 29 11 42 2",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"To order (goods or services) in advance, before they are available."
],
"id": "en-preorder-en-verb-W0FwmEnO",
"links": [
[
"order",
"order"
],
[
"in advance",
"in advance"
],
[
"available",
"available"
]
],
"raw_glosses": [
"(transitive) To order (goods or services) in advance, before they are available."
],
"tags": [
"transitive"
],
"translations": [
{
"_dis1": "87 13",
"code": "fi",
"lang": "Finnish",
"sense": "to order in advance",
"word": "ennakkotilata"
},
{
"_dis1": "87 13",
"code": "de",
"lang": "German",
"sense": "to order in advance",
"word": "vorbestellen"
},
{
"_dis1": "87 13",
"code": "el",
"lang": "Greek",
"roman": "proparangélno",
"sense": "to order in advance",
"word": "προπαραγγέλνω"
},
{
"_dis1": "87 13",
"code": "io",
"lang": "Ido",
"sense": "to order in advance",
"word": "prekomendar"
},
{
"_dis1": "87 13",
"code": "pl",
"lang": "Polish",
"sense": "to order in advance",
"word": "preorderować"
},
{
"_dis1": "87 13",
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "to order in advance",
"tags": [
"perfective"
],
"word": "prednaručiti"
},
{
"_dis1": "87 13",
"code": "sv",
"lang": "Swedish",
"sense": "to order in advance",
"word": "förbeställa"
}
]
},
{
"categories": [],
"glosses": [
"To sort or arrange beforehand."
],
"id": "en-preorder-en-verb-Hk~YWvBk",
"links": [
[
"sort",
"sort"
],
[
"arrange",
"arrange"
],
[
"beforehand",
"beforehand"
]
],
"raw_glosses": [
"(transitive) To sort or arrange beforehand."
],
"tags": [
"transitive"
]
}
],
"wikipedia": [
"preorder"
],
"word": "preorder"
}
{
"derived": [
{
"_dis1": "0 0",
"word": "preorder algebra"
},
{
"_dis1": "0 0",
"word": "preorder atom"
},
{
"_dis1": "0 0",
"word": "preorder functor"
},
{
"_dis1": "0 0",
"word": "strict preorder"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "pre",
"3": "order"
},
"expansion": "pre- + order",
"name": "prefix"
}
],
"etymology_text": "pre- + order.",
"forms": [
{
"form": "preorders",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "preorder (plural preorders)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"_dis1": "0 0",
"word": "preordered set"
}
],
"senses": [
{
"glosses": [
"An order for goods or services placed in advance."
],
"id": "en-preorder-en-noun-AJWRpnV~",
"links": [
[
"in advance",
"in advance"
]
],
"translations": [
{
"_dis1": "95 5",
"code": "bg",
"lang": "Bulgarian",
"roman": "predvarítelna porǎ́čka",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "предвари́телна поръ́чка"
},
{
"_dis1": "95 5",
"code": "fi",
"lang": "Finnish",
"sense": "order in advance",
"word": "ennakkotilaus"
},
{
"_dis1": "95 5",
"code": "de",
"lang": "German",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "Vorbestellung"
},
{
"_dis1": "95 5",
"code": "el",
"lang": "Greek",
"roman": "proparangelía",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "προπαραγγελία"
},
{
"_dis1": "95 5",
"code": "ru",
"lang": "Russian",
"roman": "predzakaz",
"sense": "order in advance",
"tags": [
"masculine"
],
"word": "предзаказ"
},
{
"_dis1": "95 5",
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "prednarudžba"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Set theory",
"orig": "en:Set theory",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "The relation of logical implication over sentences is an example of a preorder.",
"type": "example"
},
{
"ref": "2002, Yves Nievergelt, Foundations of Logic and Mathematics, Springer (Birkhäuser), page 152",
"text": "Example 436 For each set A, the relation #x5C;subseteq is a preorder on #x5C;mathcal#x7B;P#x7D;(A).",
"type": "quotation"
},
{
"ref": "2010, S. Kaci, “Refined Preference-Based Argumentation Frameworks”, in Pietro Baroni, F. Cerutti, M. Giacomin, G. R. Simari, editors, Computational Models of Argument: Proceedings of COMMA 2010, IOS Press, page 306",
"text": "Let us first compare S#x5F;1, S#x5F;2 and S#x5F;3 w.r.t. the partial preorder #x5C;succeq.",
"type": "quotation"
},
{
"text": "2000, Jean-Charles Pomerol, Sergio Barba-Romero, Multicriterion Decision in Management: Principles and Practice, Springer, Softcover, page 58,\nIt can easily be verified that the above relation is a preorder, i.e. that it is reflexive and transitive."
}
],
"glosses": [
"A binary relation that is reflexive and transitive."
],
"hyponyms": [
{
"_dis1": "44 56",
"sense": "total order",
"word": "well-order"
},
{
"_dis1": "1 99",
"sense": "binary relation that is reflexive and transitive",
"word": "equivalence relation"
}
],
"id": "en-preorder-en-noun-jn9LORwJ",
"links": [
[
"set theory",
"set theory"
],
[
"binary relation",
"binary relation"
],
[
"reflexive",
"reflexive"
],
[
"transitive",
"transitive"
]
],
"raw_glosses": [
"(set theory, order theory) A binary relation that is reflexive and transitive."
],
"topics": [
"mathematics",
"order-theory",
"sciences",
"set-theory"
],
"translations": [
{
"_dis1": "2 98",
"code": "cs",
"lang": "Czech",
"sense": "binary relation",
"tags": [
"neuter"
],
"word": "předuspořádání"
},
{
"_dis1": "2 98",
"code": "fi",
"lang": "Finnish",
"sense": "binary relation",
"word": "esijärjestys"
},
{
"_dis1": "2 98",
"code": "de",
"lang": "German",
"sense": "binary relation",
"tags": [
"feminine"
],
"word": "Präordnung"
},
{
"_dis1": "2 98",
"code": "pl",
"lang": "Polish",
"sense": "binary relation",
"tags": [
"masculine"
],
"word": "praporządek"
},
{
"_dis1": "2 98",
"code": "ru",
"lang": "Russian",
"roman": "predporjádok",
"sense": "binary relation",
"tags": [
"masculine"
],
"word": "предпоря́док"
}
]
}
],
"synonyms": [
{
"_dis1": "0 0",
"word": "quasiorder"
}
],
"wikipedia": [
"preorder"
],
"word": "preorder"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "pre",
"3": "order"
},
"expansion": "pre- + order",
"name": "prefix"
}
],
"etymology_text": "pre- + order.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "preorder (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"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": "29 22 17 22 10",
"kind": "other",
"name": "English terms prefixed with pre-",
"parents": [],
"source": "w+disamb"
}
],
"coordinate_terms": [
{
"word": "inorder"
},
{
"word": "postorder"
}
],
"examples": [
{
"ref": "2002, Gabriel Valiente, Algorithms on Trees and Graphs, Springer, page 115",
"text": "Now, the preorder traversal of a tree can be constructed from the preorder traversals of the subtrees rooted at the children of the root of the tree.",
"type": "quotation"
},
{
"ref": "2006, ISRD Group, Data Structures Using C, Tata McGraw-Hill Education, page 254",
"text": "In the program given above, tree is constructed and is traversed in inorder, preorder and postorder traversal.",
"type": "quotation"
},
{
"text": "2011, Ananda Rao Akepogu, Radhika Raju Palagiri, Data Structures and Algorithms Using C++, Pearson Education India, page 9.16,\nThe preorder traversal visits a node first after which it traverses its left subtree and then traverses its right subtree."
}
],
"glosses": [
"Such that, recursively, the root is visited before the left and right subtrees."
],
"hypernyms": [
{
"word": "depth-first"
}
],
"id": "en-preorder-en-adj-2X8cKJ4O",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"traversal",
"traversal"
],
[
"tree",
"tree"
],
[
"recursive",
"recursive"
],
[
"root",
"root"
],
[
"left",
"left"
],
[
"right",
"right"
],
[
"subtree",
"subtree"
]
],
"raw_glosses": [
"(computing theory, of a traversal of a tree) Such that, recursively, the root is visited before the left and right subtrees."
],
"raw_tags": [
"of a traversal of a tree"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"wikipedia": [
"preorder"
],
"word": "preorder"
}
{
"categories": [
"English adjectives",
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English terms prefixed with pre-",
"English uncomparable adjectives",
"English verbs"
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "pre",
"3": "order"
},
"expansion": "pre- + order",
"name": "prefix"
}
],
"etymology_text": "pre- + order.",
"forms": [
{
"form": "preorders",
"tags": [
"present",
"singular",
"third-person"
]
},
{
"form": "preordering",
"tags": [
"participle",
"present"
]
},
{
"form": "preordered",
"tags": [
"participle",
"past"
]
},
{
"form": "preordered",
"tags": [
"past"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "preorder (third-person singular simple present preorders, present participle preordering, simple past and past participle preordered)",
"name": "en-verb"
}
],
"lang": "English",
"lang_code": "en",
"pos": "verb",
"senses": [
{
"categories": [
"English transitive verbs"
],
"glosses": [
"To order (goods or services) in advance, before they are available."
],
"links": [
[
"order",
"order"
],
[
"in advance",
"in advance"
],
[
"available",
"available"
]
],
"raw_glosses": [
"(transitive) To order (goods or services) in advance, before they are available."
],
"tags": [
"transitive"
]
},
{
"categories": [
"English transitive verbs"
],
"glosses": [
"To sort or arrange beforehand."
],
"links": [
[
"sort",
"sort"
],
[
"arrange",
"arrange"
],
[
"beforehand",
"beforehand"
]
],
"raw_glosses": [
"(transitive) To sort or arrange beforehand."
],
"tags": [
"transitive"
]
}
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "to order in advance",
"word": "ennakkotilata"
},
{
"code": "de",
"lang": "German",
"sense": "to order in advance",
"word": "vorbestellen"
},
{
"code": "el",
"lang": "Greek",
"roman": "proparangélno",
"sense": "to order in advance",
"word": "προπαραγγέλνω"
},
{
"code": "io",
"lang": "Ido",
"sense": "to order in advance",
"word": "prekomendar"
},
{
"code": "pl",
"lang": "Polish",
"sense": "to order in advance",
"word": "preorderować"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "to order in advance",
"tags": [
"perfective"
],
"word": "prednaručiti"
},
{
"code": "sv",
"lang": "Swedish",
"sense": "to order in advance",
"word": "förbeställa"
}
],
"wikipedia": [
"preorder"
],
"word": "preorder"
}
{
"categories": [
"English adjectives",
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English terms prefixed with pre-",
"English uncomparable adjectives",
"English verbs"
],
"derived": [
{
"word": "preorder algebra"
},
{
"word": "preorder atom"
},
{
"word": "preorder functor"
},
{
"word": "strict preorder"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "pre",
"3": "order"
},
"expansion": "pre- + order",
"name": "prefix"
}
],
"etymology_text": "pre- + order.",
"forms": [
{
"form": "preorders",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "preorder (plural preorders)",
"name": "en-noun"
}
],
"hyponyms": [
{
"sense": "total order",
"word": "well-order"
},
{
"sense": "binary relation that is reflexive and transitive",
"word": "equivalence relation"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "preordered set"
}
],
"senses": [
{
"glosses": [
"An order for goods or services placed in advance."
],
"links": [
[
"in advance",
"in advance"
]
]
},
{
"categories": [
"English terms with quotations",
"English terms with usage examples",
"en:Set theory"
],
"examples": [
{
"text": "The relation of logical implication over sentences is an example of a preorder.",
"type": "example"
},
{
"ref": "2002, Yves Nievergelt, Foundations of Logic and Mathematics, Springer (Birkhäuser), page 152",
"text": "Example 436 For each set A, the relation #x5C;subseteq is a preorder on #x5C;mathcal#x7B;P#x7D;(A).",
"type": "quotation"
},
{
"ref": "2010, S. Kaci, “Refined Preference-Based Argumentation Frameworks”, in Pietro Baroni, F. Cerutti, M. Giacomin, G. R. Simari, editors, Computational Models of Argument: Proceedings of COMMA 2010, IOS Press, page 306",
"text": "Let us first compare S#x5F;1, S#x5F;2 and S#x5F;3 w.r.t. the partial preorder #x5C;succeq.",
"type": "quotation"
},
{
"text": "2000, Jean-Charles Pomerol, Sergio Barba-Romero, Multicriterion Decision in Management: Principles and Practice, Springer, Softcover, page 58,\nIt can easily be verified that the above relation is a preorder, i.e. that it is reflexive and transitive."
}
],
"glosses": [
"A binary relation that is reflexive and transitive."
],
"links": [
[
"set theory",
"set theory"
],
[
"binary relation",
"binary relation"
],
[
"reflexive",
"reflexive"
],
[
"transitive",
"transitive"
]
],
"raw_glosses": [
"(set theory, order theory) A binary relation that is reflexive and transitive."
],
"topics": [
"mathematics",
"order-theory",
"sciences",
"set-theory"
]
}
],
"synonyms": [
{
"word": "quasiorder"
}
],
"translations": [
{
"code": "bg",
"lang": "Bulgarian",
"roman": "predvarítelna porǎ́čka",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "предвари́телна поръ́чка"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "order in advance",
"word": "ennakkotilaus"
},
{
"code": "de",
"lang": "German",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "Vorbestellung"
},
{
"code": "el",
"lang": "Greek",
"roman": "proparangelía",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "προπαραγγελία"
},
{
"code": "ru",
"lang": "Russian",
"roman": "predzakaz",
"sense": "order in advance",
"tags": [
"masculine"
],
"word": "предзаказ"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "order in advance",
"tags": [
"feminine"
],
"word": "prednarudžba"
},
{
"code": "cs",
"lang": "Czech",
"sense": "binary relation",
"tags": [
"neuter"
],
"word": "předuspořádání"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "binary relation",
"word": "esijärjestys"
},
{
"code": "de",
"lang": "German",
"sense": "binary relation",
"tags": [
"feminine"
],
"word": "Präordnung"
},
{
"code": "pl",
"lang": "Polish",
"sense": "binary relation",
"tags": [
"masculine"
],
"word": "praporządek"
},
{
"code": "ru",
"lang": "Russian",
"roman": "predporjádok",
"sense": "binary relation",
"tags": [
"masculine"
],
"word": "предпоря́док"
}
],
"wikipedia": [
"preorder"
],
"word": "preorder"
}
{
"categories": [
"English adjectives",
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English terms prefixed with pre-",
"English uncomparable adjectives",
"English verbs"
],
"coordinate_terms": [
{
"word": "inorder"
},
{
"word": "postorder"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "pre",
"3": "order"
},
"expansion": "pre- + order",
"name": "prefix"
}
],
"etymology_text": "pre- + order.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "preorder (not comparable)",
"name": "en-adj"
}
],
"hypernyms": [
{
"word": "depth-first"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
"English terms with quotations",
"en:Theory of computing"
],
"examples": [
{
"ref": "2002, Gabriel Valiente, Algorithms on Trees and Graphs, Springer, page 115",
"text": "Now, the preorder traversal of a tree can be constructed from the preorder traversals of the subtrees rooted at the children of the root of the tree.",
"type": "quotation"
},
{
"ref": "2006, ISRD Group, Data Structures Using C, Tata McGraw-Hill Education, page 254",
"text": "In the program given above, tree is constructed and is traversed in inorder, preorder and postorder traversal.",
"type": "quotation"
},
{
"text": "2011, Ananda Rao Akepogu, Radhika Raju Palagiri, Data Structures and Algorithms Using C++, Pearson Education India, page 9.16,\nThe preorder traversal visits a node first after which it traverses its left subtree and then traverses its right subtree."
}
],
"glosses": [
"Such that, recursively, the root is visited before the left and right subtrees."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"traversal",
"traversal"
],
[
"tree",
"tree"
],
[
"recursive",
"recursive"
],
[
"root",
"root"
],
[
"left",
"left"
],
[
"right",
"right"
],
[
"subtree",
"subtree"
]
],
"raw_glosses": [
"(computing theory, of a traversal of a tree) Such that, recursively, the root is visited before the left and right subtrees."
],
"raw_tags": [
"of a traversal of a tree"
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"wikipedia": [
"preorder"
],
"word": "preorder"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 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.