aashish1904
commited on
Upload README.md with huggingface_hub
Browse files
README.md
ADDED
@@ -0,0 +1,103 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
|
2 |
+
---
|
3 |
+
|
4 |
+
license: apache-2.0
|
5 |
+
datasets:
|
6 |
+
- qingy2024/FineQwQ-142k
|
7 |
+
language:
|
8 |
+
- en
|
9 |
+
base_model:
|
10 |
+
- Qwen/Qwen2.5-7B
|
11 |
+
pipeline_tag: text-generation
|
12 |
+
|
13 |
+
---
|
14 |
+
|
15 |
+
[![QuantFactory Banner](https://lh7-rt.googleusercontent.com/docsz/AD_4nXeiuCm7c8lEwEJuRey9kiVZsRn2W-b4pWlu3-X534V3YmVuVc2ZL-NXg2RkzSOOS2JXGHutDuyyNAUtdJI65jGTo8jT9Y99tMi4H4MqL44Uc5QKG77B0d6-JfIkZHFaUA71-RtjyYZWVIhqsNZcx8-OMaA?key=xt3VSDoCbmTY7o-cwwOFwQ)](https://hf.co/QuantFactory)
|
16 |
+
|
17 |
+
|
18 |
+
# QuantFactory/UwU-7B-Instruct-GGUF
|
19 |
+
This is quantized version of [qingy2024/UwU-7B-Instruct](https://huggingface.co/qingy2024/UwU-7B-Instruct) created using llama.cpp
|
20 |
+
|
21 |
+
# Original Model Card
|
22 |
+
|
23 |
+
|
24 |
+
## UwU 7B Instruct
|
25 |
+
|
26 |
+
Small QwQ, full-finetuned on FineQwQ-142K. Unlike my previous models, this one is a general-purpose reasoning machine!
|
27 |
+
|
28 |
+
Oh, and it also passes the strawberry test:
|
29 |
+
|
30 |
+
```
|
31 |
+
> How many 'r's are in the word strawberry?
|
32 |
+
Let's see. I have this word: "strawberry." I need to find out how many 'r's are in it. Okay, first, I should probably write down the word and look at each letter one by one.
|
33 |
+
|
34 |
+
So, "s-t-r-a-w-b-e-r-r-y."
|
35 |
+
|
36 |
+
Now, I need to count the 'r's. Let's go through each letter:
|
37 |
+
|
38 |
+
- The first letter is 's', which is not an 'r'.
|
39 |
+
|
40 |
+
- The second letter is 't', not an 'r'.
|
41 |
+
|
42 |
+
- The third letter is 'r', that's the first 'r'.
|
43 |
+
|
44 |
+
- The fourth letter is 'a', not an 'r'.
|
45 |
+
|
46 |
+
- The fifth letter is 'w', not an 'r'.
|
47 |
+
|
48 |
+
- The sixth letter is 'b', not an 'r'.
|
49 |
+
|
50 |
+
- The seventh letter is 'e', not an 'r'.
|
51 |
+
|
52 |
+
- The eighth letter is 'r', that's the second 'r'.
|
53 |
+
|
54 |
+
- The ninth letter is 'r', that's the third 'r'.
|
55 |
+
|
56 |
+
- The tenth letter is 'y', not an 'r'.
|
57 |
+
|
58 |
+
So, I have three 'r's in the word "strawberry." But wait, let me double-check. Maybe I missed one.
|
59 |
+
|
60 |
+
Let me count again:
|
61 |
+
|
62 |
+
1. 's'
|
63 |
+
|
64 |
+
2. 't'
|
65 |
+
|
66 |
+
3. 'r' (first 'r')
|
67 |
+
|
68 |
+
4. 'a'
|
69 |
+
|
70 |
+
5. 'w'
|
71 |
+
|
72 |
+
6. 'b'
|
73 |
+
|
74 |
+
7. 'e'
|
75 |
+
|
76 |
+
8. 'r' (second 'r')
|
77 |
+
|
78 |
+
9. 'r' (third 'r')
|
79 |
+
|
80 |
+
10. 'y'
|
81 |
+
|
82 |
+
Yes, that's three 'r's. I think that's correct.
|
83 |
+
|
84 |
+
Alternatively, maybe there's a smarter way to count them without listing out each letter. Let's see.
|
85 |
+
|
86 |
+
I know that the word "strawberry" has 10 letters, and I can recall that it has three 'r's. But to be sure, maybe I can look for patterns or something.
|
87 |
+
|
88 |
+
Another way is to use a tally mark or something similar. Let's try that.
|
89 |
+
|
90 |
+
First 'r': | (that's one)
|
91 |
+
|
92 |
+
Second 'r': | (that's two)
|
93 |
+
|
94 |
+
Third 'r': | (that's three)
|
95 |
+
|
96 |
+
Yes, that also gives me three 'r's.
|
97 |
+
|
98 |
+
I think I'm confident with that answer now. There are three 'r's in the word "strawberry."
|
99 |
+
|
100 |
+
**Final Answer**
|
101 |
+
|
102 |
+
\[ \boxed{3} \]
|
103 |
+
```
|