• Keine Ergebnisse gefunden

Trial numbers with utterance code for nolanepg_jf2_epg

N/A
N/A
Protected

Academic year: 2022

Aktie "Trial numbers with utterance code for nolanepg_jf2_epg"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Trial numbers with utterance code for nolanepg_jf2_epg

3 SS_1_1 40 SS_1_2 83 SS_1_3 103 SS_1_4 149 SS_1_5 4 SS_2_1 66 SS_2_2 99 SS_2_3 110 SS_2_4 152 SS_2_5 7 SS_3_1 38

SS_3_2!R!

88 SS_3_3 109 SS_3_4 160 SS_3_5 170 SS_3_6 17 SS_4_1 56 SS_4_2 89 SS_4_3 131 SS_4_4 158 SS_4_5 8 Sp_1_1 43 Sp_1_2 70 Sp_1_3 107 Sp_1_4 162 Sp_1_5 6 Sp_2_1 53 Sp_2_2 72 Sp_2_3 114 Sp_2_4 144 Sp_2_5 30 Sp_3_1 68 Sp_3_2 95 Sp_3_3 115 Sp_3_4 155 Sp_3_5 24 Sp_4_1 44 Sp_4_2 82 Sp_4_3 104 Sp_4_4 141 Sp_4_5 14 Ss_1_1 54 Ss_1_2 84 Ss_1_3 120 Ss_1_4 153 Ss_1_5 18 Ss_2_1 39 Ss_2_2 75 Ss_2_3 132 Ss_2_4

136 Ss_2_5 15 Ss_3_1 63 Ss_3_2 80 Ss_3_3 118 Ss_3_4 143 Ss_3_5 34 Ss_4_1 52

Ss_4_2!R!

93 Ss_4_3 134 Ss_4_4 168

Ss_4_5!R!

33 pS_1_1 41 pS_1_2 71 pS_1_3 111 pS_1_4 139 pS_1_5 31 pS_2_1 59 pS_2_2 101 pS_2_3 123 pS_2_4 161 pS_2_5 32 pS_3_1 64 pS_3_2 81 pS_3_3 117 pS_3_4 166 pS_3_5 2 pS_4_1 67 pS_4_2 85 pS_4_3 116 pS_4_4 145 pS_4_5 27 ps_1_1 29

ps_1_1!R!

35 ps_1_2 73 ps_1_3 106 ps_1_4 154 ps_1_5 171 ps_1_6 10 ps_2_1 62 ps_2_2 94 ps_2_3 108 ps_2_4 137 ps_2_5 11 ps_3_1 46 ps_3_2 92 ps_3_3 133 ps_3_4 165 ps_3_5

5 ps_4_1 69 ps_4_2 100 ps_4_3 129 ps_4_4 142 ps_4_5 13 sS_1_1 65 sS_1_2 86 sS_1_3 122 sS_1_4 138 sS_1_5 22 sS_2_1 57 sS_2_2 102 sS_2_3 113 sS_2_4 147 sS_2_5 1 sS_3_1 50 sS_3_2 91 sS_3_3 128 sS_3_4 140 sS_3_5 26 sS_4_1 45 sS_4_2 78 sS_4_3 121 sS_4_4 146 sS_4_5 19 sp_1_1 49 sp_1_2 90 sp_1_3 112 sp_1_4 164 sp_1_5 9 sp_2_1 61 sp_2_2 74 sp_2_3 130 sp_2_4 157 sp_2_5 169 sp_2_6 20 sp_3_1 47 sp_3_2 87 sp_3_3 127 sp_3_4 148 sp_3_5 21 sp_4_1 55 sp_4_2 96 sp_4_3 119 sp_4_4 159 sp_4_5 23 ss_1_1 58 ss_1_2 77

ss_1_3!R!

126

ss_1_4!R!

163 ss_1_5 12 ss_2_1 42 ss_2_2 97 ss_2_3 105 ss_2_4 151 ss_2_5 16 ss_3_1 48 ss_3_2 79 ss_3_3 124 ss_3_4 150 ss_3_5 25 ss_4_1 60 ss_4_2 98 ss_4_3 135 ss_4_4 156 ss_4_5

Referenzen

ÄHNLICHE DOKUMENTE

In this paper we transform the problem of finding a uniquely hamiltonian planar graph with minimum degree three into a bi-objective optimization prob- lem which minimizes the

The main goal of this work is to design an algorithm which can check lower bounds on the independence number for smooth graphs and either prove them for all graphs with a given

For example, a type 5 (+−++) (monotonic, nonproper, strong, nonweak) computable game has Nakamura number equal to 2, whether it is finite or infinite.. 4 Note that the Nakamura

• Practice fast and slow version of last 3 slides (maybe have an extra slide you might skip).. Some

• Neural Machine Translation By Jointly Learning To Align And Translate [Link]. • Attention Is All You

Our results show that the additional context informa- tion we collect improves prediction quality, and that PBN can obtain comparable prediction quality to BMN, while model size

Cliquez sur ce bouton pour numériser l’original et le visualiser dans la fenêtre Aperçu zone d’impression. Cette fenêtre vous permet notamment de confirmer la zone destinée

This analysis makes all aspects of context available for sentences in indirect speech, and at the same time offers a well-defined semantic link between matrix