Update README.md
Browse files
README.md
CHANGED
@@ -27,7 +27,7 @@ This model is a fine-tuned version of google/gemma-2b on an SaikatM/Code-Platypu
|
|
27 |
|
28 |
### Model Sources
|
29 |
|
30 |
-
Training
|
31 |
|
32 |
### Direct Use
|
33 |
|
@@ -93,15 +93,50 @@ SFTTrainer(
|
|
93 |
Took around 1 hour to train.
|
94 |
|
95 |
### Results
|
96 |
-
|
97 |
```<bos>Write a fucntion to sort a list in python.<eos>
|
98 |
-
|
99 |
Answer:
|
100 |
|
101 |
def sort_list(list):
|
102 |
return sorted(list)<eos>
|
103 |
Response: None
|
104 |
```
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
105 |
|
106 |
### Compute Infrastructure
|
107 |
|
|
|
27 |
|
28 |
### Model Sources
|
29 |
|
30 |
+
Training code can be found here: https://github.com/Saikat-M/LLM-Finetuning
|
31 |
|
32 |
### Direct Use
|
33 |
|
|
|
93 |
Took around 1 hour to train.
|
94 |
|
95 |
### Results
|
96 |
+
* Test Results 1:
|
97 |
```<bos>Write a fucntion to sort a list in python.<eos>
|
|
|
98 |
Answer:
|
99 |
|
100 |
def sort_list(list):
|
101 |
return sorted(list)<eos>
|
102 |
Response: None
|
103 |
```
|
104 |
+
* Test Result 2:
|
105 |
+
```<bos>Write a function to generate fibonacci series in Python<eos><eos>
|
106 |
+
Response: None
|
107 |
+
```
|
108 |
+
* Test Result 3:
|
109 |
+
```<bos>Write a function to count Consonants in a Given Word in Python<eos>10.1.1
|
110 |
+
|
111 |
+
Write a function to count the number of vowels in a given string in Python.
|
112 |
+
|
113 |
+
Example 1:
|
114 |
+
|
115 |
+
Input: s = "leetcodeisgreat"
|
116 |
+
Output: 5
|
117 |
+
Explanation: The vowels are 'e', 'i', 'a', 'o', and 'u'.
|
118 |
+
|
119 |
+
Example 2:
|
120 |
+
|
121 |
+
Input: s = "leetcodeisgreat"
|
122 |
+
Output: 0
|
123 |
+
Explanation: The vowels are 'e', 'i', 'a', 'o', and 'u'.
|
124 |
+
|
125 |
+
Constraints:
|
126 |
+
|
127 |
+
* 1 <= s.length <= 100
|
128 |
+
* s consists of lowercase English letters.
|
129 |
+
|
130 |
+
|
131 |
+
def countVowels(s):
|
132 |
+
count = 0
|
133 |
+
for c in s:
|
134 |
+
if c in 'aeiou':
|
135 |
+
count += 1
|
136 |
+
return count
|
137 |
+
<eos>
|
138 |
+
Response: None
|
139 |
+
```
|
140 |
|
141 |
### Compute Infrastructure
|
142 |
|