| Autor: |
Borodynya, Maxim, Doichev, Vladimir, Cyrenzhapov, Aur, Peresunko, Pavel |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2024, Vol. 3021 Issue 1, p1-7, 7p |
| Abstrakt: |
This article demonstrates the solution of the optimization problem of selecting the optimal keyboard consisting of the regular hexagonal keys. Conditional probabilities of all bigrams consisting of pairs of tokens were calculated using a sufficiently large text in English, where tokens are all valid characters from the text. After that, the objective function was determined: the scalar product of the probabilities of all possible pairs of bigrams by the distance between the tokens of identical pairs of bigrams in the selected keyboard. Next, the components of the simulated annealing for solving this problem are determined. In addition, the algorithm has been divided into three versions, each of which has a unique temperature function. By running three versions of the algorithm thirty times for each version, a comparison was made between the difference in the estimates of the effectiveness of the initial keyboard and the keyboard that the algorithm returned at the last iteration. The result showed that the efficiency of the key arrangement increased after each run of the algorithm, and also that the efficiency of the algorithm with uneven temperature functions turned out to be statistically significantly higher than with an even one. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
