-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathlib.rs
More file actions
192 lines (177 loc) · 7.22 KB
/
lib.rs
File metadata and controls
192 lines (177 loc) · 7.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
#[cfg(test)]
mod tests {
use itertools::Itertools;
use rand::{rng, RngExt};
use tiktoken_rs::cl100k_base_singleton;
use bpe::appendable_encoder::AppendableEncoder;
use bpe::byte_pair_encoding::{create_test_bytes, BytePairEncoding};
use bpe::interval_encoding::IntervalEncoding;
use bpe::prependable_encoder::PrependableEncoder;
use bpe_openai::cl100k_base;
/// This test produces the output for the encoding example in the README.
#[test]
fn readme_example() {
let tokens = ["a", "b", "c", "ab", "cb", "ac", "bb", "cbb", "acbb"];
let bpe = BytePairEncoding::from_dictionary(tokens.map(|t| t.as_bytes().to_vec()), None);
let text = "abacbb";
let prefixes = (1..=text.len()).map(|end| &text[..end]).collect_vec();
let all_prefix_tokens = prefixes
.iter()
.map(|prefix| {
bpe.encode_via_backtracking(prefix.as_bytes())
.into_iter()
.map(|t| String::from_utf8(bpe.decode_tokens(&[t])).unwrap())
.collect_vec()
})
.collect_vec();
let last_prefix_tokens = all_prefix_tokens
.iter()
.map(|tokens| tokens.last().unwrap())
.collect_vec();
println!("Token set: `{}`\n", tokens.join(" "));
println!("All tokens for each prefix of `{text}`:\n");
for (prefix, tokens) in prefixes.iter().zip(&all_prefix_tokens) {
println!(
"- `{prefix}` {}> `{}`",
"-".repeat(text.len() + 2 - prefix.len()),
tokens.join(" ")
);
}
println!();
println!("Last token for each prefix of `{text}`:\n");
for (prefix, token) in prefixes.iter().zip(&last_prefix_tokens) {
println!(
"- `{prefix}` {}> `{token}`",
"-".repeat(text.len() + 2 - prefix.len()),
);
}
println!();
println!("Encoding using last tokens of `{text}`:\n");
let mut remaining = text.len();
while remaining > 0 {
let prefix = &text[..remaining];
let token = last_prefix_tokens[remaining - 1];
println!(
"- `{prefix}` {}> `{token}`",
"-".repeat(text.len() + 2 - prefix.len()),
);
remaining -= token.len();
}
println!("- `<empty>`");
}
#[test]
fn test_appendable_encoder() {
let bpe = &cl100k_base().bpe;
let mut enc = AppendableEncoder::new(bpe);
let input = create_test_bytes(bpe, 100);
for (i, b) in input.iter().enumerate() {
enc.push(*b);
assert_eq!(enc.token_count(), bpe.count(&input[0..i + 1]));
}
}
#[test]
fn test_correctness() {
// This is quite a challenging test case...
let input = std::str::from_utf8(&[
125, 34, 10, 10, 46, 109, 107, 100, 105, 114, 115, 32, 102, 100, 115, 32, 97, 100, 105,
112, 105, 115, 105, 99, 105, 110, 103, 105, 116, 121, 69, 110, 103, 105, 110, 101, 32,
69, 67, 105, 114, 105, 101, 32, 111, 112, 116, 105, 109, 97, 108, 95, 68, 65, 32, 111,
102, 102, 101, 110, 100,
])
.unwrap();
let bpe = &cl100k_base().bpe;
let encoded1 = cl100k_base_singleton()
.encode_ordinary(input)
.into_iter()
.collect_vec();
let encoded2 = bpe.encode_via_backtracking(input.as_bytes());
assert_eq!(encoded1, encoded2);
let encoded3 = bpe.encode_via_table(input.as_bytes());
assert_eq!(encoded1, encoded3);
let encoded4 = bpe.encode_via_bitfield(input.as_bytes());
assert_eq!(encoded1, encoded4);
}
#[test]
fn test_bpe_equivalence() {
let bpe = &cl100k_base().bpe;
for bytes in [10, 1000, 10000] {
for _ in 0..8 {
let input = create_test_bytes(bpe, bytes);
let encoded1 = bpe.encode_via_backtracking(&input);
let encoded2 = bpe.encode_via_bitfield(&input);
assert_eq!(encoded1, encoded2, "{} {}", encoded1.len(), encoded2.len());
let encoded3 = bpe.encode_via_table(&input);
assert_eq!(encoded1, encoded3, "{} {}", encoded1.len(), encoded3.len());
}
}
}
#[test]
fn test_interval_count() {
let bpe = &cl100k_base().bpe;
let input = create_test_bytes(bpe, 10000);
let intervals = IntervalEncoding::new(bpe, &input);
for _ in 0..1000 {
let start = rng().random_range(0..input.len());
let end = rng().random_range(0..input.len());
let range = start.min(end)..start.max(end);
assert_eq!(
intervals.count(range.clone()),
bpe.encode_via_backtracking(&input[range]).len()
);
}
}
#[test]
fn test_prependable_encoder() {
let bpe = &cl100k_base().bpe;
let mut enc = PrependableEncoder::new(bpe);
let input = create_test_bytes(bpe, 100);
for (i, b) in input.iter().enumerate().rev() {
enc.push(*b);
assert_eq!(enc.token_count(), bpe.count(&input[i..]));
}
}
#[test]
fn test_bpe_dropout() {
use rand::rngs::StdRng;
use rand::SeedableRng;
fn get_rng(seed: u64) -> StdRng {
// Expand the u64 seed to 32 bytes
let mut seed_bytes = [0u8; 32];
seed_bytes[..8].copy_from_slice(&seed.to_le_bytes());
StdRng::from_seed(seed_bytes)
}
let bpe = &cl100k_base().bpe;
let bytes = 10000;
for _ in 0..8 {
let input = create_test_bytes(bpe, bytes);
let encoded = bpe.encode_minimal(&input);
let encoded_d_0_2 = bpe.encode_minimal_dropout(&input, 0.2, get_rng(0));
let encoded_d_0_9 = bpe.encode_minimal_dropout(&input, 0.9, get_rng(1));
let encoded_d_1_0 = bpe.encode_minimal_dropout(&input, 1.0, get_rng(1));
let encoded_d_0_9_again = bpe.encode_minimal_dropout(&input, 0.9, get_rng(1));
let decoded = bpe.decode_tokens(&encoded);
let decoded_min = bpe.decode_tokens(&encoded_d_0_2);
let decoded_max = bpe.decode_tokens(&encoded_d_0_9);
let decoded_max_again = bpe.decode_tokens(&encoded_d_0_9_again);
println!(
"Input length: {}, Encoded length: {}, Encoded with dropout length: {}-{}, max {}",
input.len(),
encoded.len(),
encoded_d_0_2.len(),
encoded_d_0_9.len(),
encoded_d_0_9_again.len()
);
assert_eq!(encoded_d_0_9, encoded_d_0_9_again);
assert_eq!(input, decoded);
assert_eq!(input, decoded_min);
assert_eq!(input, decoded_max);
assert_eq!(input, decoded_max_again);
assert_eq!(input.len(), encoded_d_1_0.len());
assert!(encoded_d_0_2.len() >= encoded.len());
assert!(encoded_d_0_9.len() > encoded.len());
assert_ne!(encoded, encoded_d_0_2);
assert_ne!(encoded, encoded_d_0_9);
assert_ne!(encoded_d_0_9, encoded_d_1_0);
}
}
}