Optimal Scheduling of the Leaves of a Tree and the SVO Frequencies of Languages
We define and study algorithmically a novel optimization problem related to the sequential scheduling of the leaves of a binary tree in a given order, and its generalization in which the optimum order is sought. We assume that the scheduling process starts at the root of the tree and continues bread...
Saved in:
| Published in | Learning and Intelligent Optimization Vol. 13621; pp. 3 - 14 |
|---|---|
| Main Authors | , |
| Format | Book Chapter |
| Language | English |
| Published |
Switzerland
Springer International Publishing AG
2023
Springer International Publishing |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783031248658 3031248651 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-031-24866-5_1 |
Cover
| Summary: | We define and study algorithmically a novel optimization problem related to the sequential scheduling of the leaves of a binary tree in a given order, and its generalization in which the optimum order is sought. We assume that the scheduling process starts at the root of the tree and continues breadth-first in parallel, albeit with possible intervening lock and unlock steps, which define the scheduling cost. The motivation for this problem comes from modeling language generation in the brain. We show that optimality considerations in this problem provide a new explanation for an intriguing phenomenon in linguistics, namely that certain ways of ordering the subject, verb, and object in a sentence are far more common in world languages than others. |
|---|---|
| ISBN: | 9783031248658 3031248651 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-031-24866-5_1 |