### Table 2: Occurrences of snomed-tagged lemmas.

1997

"... In PAGE 3: ...rox. 12500 terms). We then projected these categories on the lemmas on the CC/KC nodes. Table2 shows,for the NP sub-corpus, the number of categorized lemmas per snomed category and the corresponding number of occurrences according to AlethIPGN and Lexter. Our hope that a CC would group together lemmas that belong to a common semantic category was widely confirmed.... ..."

Cited by 10

### Table 1: Some lemmas speculated by the divergence critic.

"... In PAGE 11: ... 8. Results Table1 lists 30 theorems that cause Spike to diverge and the lemmas speculated by the divergence critic after analysing the diverging proof attempts. These problems provide a representative sample of the type of theorems for which the cause of divergence can be identi#0Ced and an appropriate lemma or generalization speculated.... ..."

### Table 6: The proof of Lemma 6.9

"... In PAGE 18: ...roof We use Lemmas 6.2 and 6.3 to give the proof. According to Lemma 6.7, we need to prove the existence of HSD(2nu1) for 65 u 244 and [5u=4]+14 n 318. The details are listed in Table6 . The notations in the table are as same as those in Table 5.... ..."

### Table 5: The proof of Lemma 6.5

"... In PAGE 17: ...4, we need to prove that an HSD(2nu1) exists for [5u=4]+ 12 n 84. We list the details in Table5 for 16 u 60. In the column of authority, Ai(m) or Bj(m) means that the results come from Lemma 6.... ..."

### Table 2. ID# Word Lemma Grammatical

"... In PAGE 5: ... post:3:. Table2 . Feature vector for the sentence The engine throbbed into life.... In PAGE 5: ... Feature vector for the sentence The engine throbbed into life. As the example in Table2 indicates, combination of contextual, syntactic and semantic information types results in a large number of features. Inspection of the training data reveals that some features may be more important than others in establishing verb class assignment for each choice of verb lemma.... ..."

### Table 1: Case analysis in the proof of Lemma 25.

1996

Cited by 44

### Table 1: Number of pairs satisfying Lemma 1.

"... In PAGE 70: ... 55-74. Table1 . Number of pairs satisfying Lemma 1.... In PAGE 77: ....e. how often it gives the answer NO when the right answers is YES . Table1 summarizes the results. Columns 2 and 3 give the number of inputs n and the number of outputs m of the function.... In PAGE 85: ... We have also applied the presented heuristic to the benchmarks reported in [13], [12] and [14]. The results are summarized in Table1 . Column 4 shows how many non-trivial strong bound sets are found for each benchmark by our algorithm.... In PAGE 85: ...008 - 1.90 - Table1 : Experimental results; ;; indicates that information for the benchmark is not provided; gt; indicates that information is only provided for one of the outputs. [5] W.... ..."

### Table 5: lemmas and dependencies average precision

"... In PAGE 4: ... In this part, we merged the two descriptors in one index and evaluated the different weighting schemes for that index. As for the preceding experimentation, we first evaluate the derivation from randomness (Table 4) and then we evaluate the different weighting methods ( Table5 ). c Average precision 0 0,0207 1 0,3798 1,5 0,3941 2 0,3947 2,25 0,3947 2,5 0,3934 3 0,3922 Table 4: Variation of c for nRn nnn (lemmas and dependencies) Query weighting lemmas dependencies Document Weighting nnn bnn lnn npn ntn nnn bnn lnn npn ntn nnn 1,82 0,81 1,57 21,43 16,43 9,01 5,56 8,16 18,21 17,96 lnc 35,02 31,27 36,22 34,30 37,46 18,92 17,46 19,17 21,93 21,94 ltc 33,13 33,93 35,94 32,86 33,79 21,14 18,94 20,86 21,66 21,66 nRn 47,28 38,34 45,55 45,23 48,35 26,01 22,56 25,90 24,95 ... ..."

### Table 3: Inputs for Lemma 2.3

"... In PAGE 5: ...3 If A assigns p1 to M1, the competitive ratio of A is at least c(s) for 1 s lt; 2. Proof: Consider Table3 . Note that row 4 is valid only for s 3=2, while rows 5 and 10 are valid for s gt; 3=2.... In PAGE 7: ...Table 3: Inputs for Lemma 2.3 If A assigns p1 to M1, the first four rows in Table3 together with row 6 show that the competitive ratio of A is at least 4s=3, and the first four rows together with rows 7-9 imply that the competitive ratio of A is at least min f3s=2; 6=(2s + 1)g. Thus the competitive ratio for 1 s 3=2 is at least q(s) = maxf4s=3; min f3s=2; 6=(2s + 1)gg.... ..."

Cited by 1

### Table 1. Number of pairs satisfying Lemma 1.

"... In PAGE 77: ....e. how often it gives the answer NO when the right answers is YES . Table1 summarizes the results. Columns 2 and 3 give the number of inputs n and the number of outputs m of the function.... In PAGE 80: ...Table1 : Number of pairs satisfying Lemma 1. Example n m jF f j N 5xp1 7 10 65 27 9sym 9 1 86 301 alu2 10 8 68 1 alu3 10 8 66 0 alu4 14 8 575 114 amd 14 24 66 7 b2 16 17 106 2 b9 16 5 119 111 b10 15 11 100 3 b12 15 9 43 2 bc0 26 11 179 41 bw 5 28 22 2 clip 9 5 120 28 con1 7 2 9 1 cordic 23 2 155 96 dist 8 5 123 60 duke2 22 29 86 9 ex7 16 5 119 111 exam 10 10 67 0 ex1010 10 10 284 1 f51m 8 8 77 44 gary 15 11 107 11 in0 15 11 107 11 in1 16 17 62 2 in2 19 10 136 11 in5 24 14 62 0 inc 7 9 30 3 life 9 1 84 724 misex1 8 7 12 0 misex2 25 18 28 0 misex3 14 14 690 161 misex3c 14 14 197 86 mlp4 8 8 128 52 newapla2 6 7 7 0 newbyte 5 8 8 0 newcpla1 9 16 38 0 newtpla 15 5 23 0 p1 8 18 55 1 radd 8 5 75 73 rd53 5 3 31 198 rd73 7 3 127 1304 rd84 8 4 255 7590 root 8 5 57 15 ryy6 16 1 112 0 sao2 10 4 58 53 shift 19 16 100 0 squar5 5 8 25 6 sqn 7 3 38 3 sym10 10 1 210 1918 t481 16 1 481... In PAGE 85: ... We have also applied the presented heuristic to the benchmarks reported in [13], [12] and [14]. The results are summarized in Table1 . Column 4 shows how many non-trivial strong bound sets are found for each benchmark by our algorithm.... In PAGE 85: ...008 - 1.90 - Table1 : Experimental results; ;; indicates that information for the benchmark is not provided; gt; indicates that information is only provided for one of the outputs. [5] W.... ..."