3 """Configuration of check_neo, mainly the weights of the cost functions. Intended to be easily modified."""
5 #: The mutated letters - only these get changed.
6 abc
= "abcdefghijklmnopqrstuvwxyzäöüß,."
8 WEIGHT_POSITION
= 1 #: reference cost - gets multiplied with the COST_PER_KEY.
10 WEIGHT_FINGER_REPEATS
= 32 #: Cost of a finger repeat. Gets additional +1 from the row change on the same finger.
12 WEIGHT_FINGER_REPEATS_TOP_BOTTOM
= 64 #: Additional cost of a finger repetition from the top to the bottom line. Gets added to the cost of the normal finger repetition. Additionally this gets costs as row repetition on the same hand (+4).
14 WEIGHT_BIGRAM_ROW_CHANGE_PER_ROW
= 1 #: When I have to switch the row in a bigram while on the same hand, that takes time => Penalty per (row to cross / horizontal distance)² if we’re on the same hand.
16 WEIGHT_COUNT_ROW_CHANGES_BETWEEN_HANDS
= False #: Should we count a row change with a handswitch as row change?
19 WEIGHT_FINGER_DISBALANCE
= 30 #: multiplied with the standard deviation of the finger usage - value guessed and only valid for the 1gramme.txt corus.
21 WEIGHT_TOO_LITTLE_HANDSWITCHING
= 50 #: how high should it be counted, if the hands aren’t switched in a triple?
23 WEIGHT_NO_HANDSWITCH_AFTER_DIRECTION_CHANGE
= 1 #: how much stronger should the triple without handswitch be counted, if there also is a direction change? Also affects the “unweighted” result from total_cost!
24 WEIGHT_NO_HANDSWITCH_WITHOUT_DIRECTION_CHANGE
= 0 #: how much stronger should the triple without handswitch be counted, if there also is a direction change? Also affects the “unweighted” result from total_cost!
26 WEIGHT_INTENDED_FINGER_LOAD_LEFT_PINKY_TO_RIGHT_PINKY
= [
36 1] #: The intended load per finger. Inversed and then used as multiplier for the finger load before calculating the finger disbalance penalty. Any load distribution which strays from this optimum gives a penalty.
38 WEIGHT_XCVZ_ON_BAD_POSITION
= 0.6 #: the penalty *per letter* in the text if xvcz are on bad positions (cumulative; if all 4 are on bad positions (not in the first 5 keys, counted from the left side horizontally) we get 4 times the penalty).
40 WEIGHT_FINGER_SWITCH
= 1 #: how much worse is it to switch from middle to indexfinger compared with middle to pinky (~30ms according to Rohmert).
42 #: The cost for moving from one finger to another one with middle-to-index as 1 (30ms). Currently only uses the neighbors. Can also be used to favor a certain dairection. Adapted the Rohmert times as per my own experiences: http://lists.neo-layout.org/pipermail/diskussion/2010-May/017171.html and http://lists.neo-layout.org/pipermail/diskussion/2010-May/017321.html
43 FINGER_SWITCH_COST
= {
44 "Klein_L": {"Ring_L": 2}, # 100ms
45 "Ring_L": {"Klein_L": 3,
46 "Mittel_L": 5}, # 140ms
47 "Mittel_L": {"Ring_L": 4,
48 "Zeige_L": 1}, # Nach Rohmert 230ms statt 200ms ⇒ 30ms
49 "Zeige_L": {"Mittel_L": 4}, # 120ms
52 "Zeige_R": {"Mittel_R": 4},
53 "Mittel_R": {"Zeige_R": 1,
55 "Ring_R": {"Mittel_R": 5,
57 "Klein_R": {"Ring_R": 2}
60 WEIGHT_NO_HANDSWITCH_AFTER_UNBALANCING_KEY
= 100 #: How much penalty we want if there’s no handswitching after an unbalancing key. Heavy unbalancing (wkßz, M3 right, return and the shifts) counts double (see UNBALANCING_POSITIONS). This also gives a penalty for handswitching after an upparcase letter.
62 #: Positions which pull the hand from the base row, position and cost (the strength of the pulling from base row).
63 UNBALANCING_POSITIONS
= {
75 (2, 13, 0): 2, # Return
76 (3, 0, 0): 2, # L_Shift
77 (3, 12, 0): 2, # R_Shift
81 # Structured key weighting (but still mostly from experience and deducing from the work of others).
82 # The speed of the fingers is taken out (see INTENDED_FINGER_LOAD_LEFT_PINKY_TO_RIGHT_PINKY).
83 # So this shows the reachability of the keys, ignoring the different speed of the fingers.
84 # “How much does the hand hurt when reaching for the key” :)
85 # rationale: reaching for the Neo 2 x hurts thrice as much as just hitting the Neo2 u → 10 vs. 3.
86 # the upper keys on the right hand can be reached a bit better, since movement is aligned with the hand
87 # (except for q, since the pinky is too short for that).
88 # theoretical minimum (assigning the lowest cost to the most frequent char, counting only the chars on layer 1):
89 # 1123111113 = 3.3490913205386508 mean key position cost
90 # Ringfinger on lower row takes 1.5 times the time of index on the upper row[1].
91 # [1]: http://forschung.goebel-consult.de/de-ergo/rohmert/Rohmert.html - only one person!
92 COST_PER_KEY
= [ # the 0 values aren’t filled in at the moment.
93 [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,22, 0, 0], # Zahlenreihe (0)
94 [0, 10, 6, 5, 6, 9, 10, 5, 4, 5, 8,12,18, 0], # Reihe 1
95 [0, 3, 3, 3, 3, 5, 5, 3, 3, 3, 3, 5,10,18], # Reihe 2
96 [15,10,12,12,10, 10, 15, 7, 6,11,11,10, 15], # Reihe 3
97 [0,0,0, 3 , 0, 0, 0, 0] # Reihe 4 mit Leertaste
100 # for reference the neo layout
102 [("^"),("1"),("2"),("3"),("4"),("5"),("6"),("7"),("8"),("9"),("0"),("-"),("`"),("←")], # Zahlenreihe (0)
103 [("⇥"),("x"),("v"),("l"),("c"),("w"),("k"),("h"),("g"),("f"),("q"),("ß"),("´"),()], # Reihe 1
104 [("⇩"),("u"),("i"),("a"),("e"),("o"),("s"),("n"),("r"),("t"),("d"),("y"),("⇘"),("\n")], # Reihe 2
105 [("⇧"),(),("ü"),("ö"),("ä"),("p"),("z"),("b"),("m"),(","),("."),("j"),("⇗")], # Reihe 3
106 [(), (), (), (" "), (), (), (), ()] # Reihe 4 mit Leertaste
110 #: The positions which are by default accessed by the given finger.
112 "Klein_L": [(1, 1, 0), (2, 0, 0), (2, 1, 0), (3, 0, 0), (3, 1, 0), (3, 2, 0)], # Klein_L
113 "Ring_L": [(1, 2, 0), (2, 2, 0), (3, 3, 0)], # Ring_L
114 "Mittel_L": [(1, 3, 0), (2, 3, 0), (3, 4, 0)], # Mittel_L
115 "Zeige_L": [(1, 4, 0), (2, 4, 0), (3, 5, 0), (1, 5, 0), (2, 5, 0), (3, 6, 0)], # Zeige_L
116 "Daumen_L": [(4, 3, 0)], # Daumen_L
117 "Daumen_R": [(4, 3, 0)], # Daumen_R
118 "Zeige_R": [(1, 6, 0), (2, 6, 0), (3, 7, 0), (1, 7, 0), (2, 7, 0), (3, 8, 0)], # Zeige_R
119 "Mittel_R": [(1, 8, 0), (2, 8, 0), (3, 9, 0)], # Mittel_R
120 "Ring_R": [(1, 9, 0), (2, 9, 0), (3, 10, 0)], # Ring_R
121 "Klein_R": [(1, 10, 0), (2, 10, 0), (3, 11, 0), (1, 11, 0), (2, 11, 0), (1, 12, 0), (2, 12, 0), (2, 13, 0), (3, 12, 0)] # Klein_R