add deepseek bench
Browse files- benches/deepseek.rs +168 -0
benches/deepseek.rs
ADDED
|
@@ -0,0 +1,168 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
//! deepseek-v3 pretokenization: my single-pass `fsm_deepseek` vs the REAL pretokenizer — the
|
| 2 |
+
//! `Sequence` of three Isolated `Split`s (`\p{N}{1,3}` → CJK-range → big regex) composed with onig,
|
| 3 |
+
//! exactly as HF applies them (each split runs on the previous split's pieces, so lookaheads see
|
| 4 |
+
//! piece boundaries). Byte-exactness gate (✓/✗) + per-language timing on big real text.
|
| 5 |
+
//!
|
| 6 |
+
//! Run: cargo bench --bench deepseek
|
| 7 |
+
use fast_split::classify::{Atoms, classify, classify_scalar};
|
| 8 |
+
use fast_split::fsm::{Span, fsm_deepseek};
|
| 9 |
+
use onig::Regex;
|
| 10 |
+
use std::hint::black_box;
|
| 11 |
+
use std::time::Instant;
|
| 12 |
+
|
| 13 |
+
const P_NUM: &str = r"\p{N}{1,3}";
|
| 14 |
+
const P_CJK: &str = r"[一-龥-ゟ゠-ヿ]+";
|
| 15 |
+
// big regex (Split-3). r##"…"## because the pattern contains " and #.
|
| 16 |
+
const P_BIG: &str = r##"[!"#$%&'()*+,\-./:;<=>?@\[\\\]^_`{|}~][A-Za-z]+|[^\r\n\p{L}\p{P}\p{S}]?[\p{L}\p{M}]+| ?[\p{P}\p{S}]+[\r\n]*|\s*[\r\n]+|\s+(?!\S)|\s+"##;
|
| 17 |
+
|
| 18 |
+
const CORPORA: &[(&str, &str)] = &[
|
| 19 |
+
("English", "../data/big.txt"),
|
| 20 |
+
("French", "benches/data/fr.txt"),
|
| 21 |
+
("Russian", "benches/data/ru.txt"),
|
| 22 |
+
("Greek", "benches/data/el.txt"),
|
| 23 |
+
("Arabic", "benches/data/ar.txt"),
|
| 24 |
+
("Hindi", "benches/data/hi.txt"),
|
| 25 |
+
("Thai", "benches/data/th.txt"),
|
| 26 |
+
("Chinese", "benches/data/zh.txt"),
|
| 27 |
+
("Japanese", "../data/unigram_wagahaiwa_nekodearu.txt"),
|
| 28 |
+
("Korean", "benches/data/ko.txt"),
|
| 29 |
+
];
|
| 30 |
+
|
| 31 |
+
// One Isolated split of text[s..e] by `re`: emit gaps + matches (all pieces), absolute offsets.
|
| 32 |
+
fn split_iso(text: &str, s: usize, e: usize, re: &Regex, out: &mut Vec<(usize, usize)>) {
|
| 33 |
+
let sub = &text[s..e];
|
| 34 |
+
let mut prev = 0usize;
|
| 35 |
+
for (ms, me) in re.find_iter(sub) {
|
| 36 |
+
if ms > prev {
|
| 37 |
+
out.push((s + prev, s + ms));
|
| 38 |
+
}
|
| 39 |
+
out.push((s + ms, s + me));
|
| 40 |
+
prev = me;
|
| 41 |
+
}
|
| 42 |
+
if prev < sub.len() {
|
| 43 |
+
out.push((s + prev, e));
|
| 44 |
+
}
|
| 45 |
+
}
|
| 46 |
+
|
| 47 |
+
// The reference: the 3-split Sequence composed exactly as HF applies it.
|
| 48 |
+
fn deepseek_ref(text: &str, re_num: &Regex, re_cjk: &Regex, re_big: &Regex) -> Vec<Span> {
|
| 49 |
+
let mut p1 = Vec::new();
|
| 50 |
+
split_iso(text, 0, text.len(), re_num, &mut p1);
|
| 51 |
+
let mut p2 = Vec::new();
|
| 52 |
+
for (s, e) in p1 {
|
| 53 |
+
split_iso(text, s, e, re_cjk, &mut p2);
|
| 54 |
+
}
|
| 55 |
+
let mut p3 = Vec::new();
|
| 56 |
+
for (s, e) in p2 {
|
| 57 |
+
split_iso(text, s, e, re_big, &mut p3);
|
| 58 |
+
}
|
| 59 |
+
p3.into_iter().map(|(s, e)| (s as u32, e as u32)).collect()
|
| 60 |
+
}
|
| 61 |
+
|
| 62 |
+
fn ns_per_byte<F: FnMut() -> usize>(len: usize, iters: u32, mut f: F) -> f64 {
|
| 63 |
+
for _ in 0..3 {
|
| 64 |
+
black_box(f());
|
| 65 |
+
}
|
| 66 |
+
let mut best = f64::INFINITY;
|
| 67 |
+
for _ in 0..7 {
|
| 68 |
+
let t = Instant::now();
|
| 69 |
+
let mut acc = 0usize;
|
| 70 |
+
for _ in 0..iters {
|
| 71 |
+
acc = acc.wrapping_add(f());
|
| 72 |
+
}
|
| 73 |
+
black_box(acc);
|
| 74 |
+
best = best.min(t.elapsed().as_nanos() as f64 / (iters as usize * len) as f64);
|
| 75 |
+
}
|
| 76 |
+
best
|
| 77 |
+
}
|
| 78 |
+
|
| 79 |
+
fn report_diff(corpus: &str, ours: &[Span], reference: &[Span]) -> &'static str {
|
| 80 |
+
if ours == reference {
|
| 81 |
+
return "✓";
|
| 82 |
+
}
|
| 83 |
+
let mut k = 0;
|
| 84 |
+
while k < ours.len() && k < reference.len() && ours[k] == reference[k] {
|
| 85 |
+
k += 1;
|
| 86 |
+
}
|
| 87 |
+
let ctx = |lo: usize, hi: usize| {
|
| 88 |
+
let (a, b) = (lo.saturating_sub(6), (hi + 6).min(corpus.len()));
|
| 89 |
+
let (mut a, mut b) = (a, b);
|
| 90 |
+
while !corpus.is_char_boundary(a) { a -= 1; }
|
| 91 |
+
while !corpus.is_char_boundary(b) { b += 1; }
|
| 92 |
+
corpus[a..b].escape_debug().to_string()
|
| 93 |
+
};
|
| 94 |
+
let (os, oe) = (ours[k].0 as usize, ours[k].1 as usize);
|
| 95 |
+
let (rs, re) = (reference[k].0 as usize, reference[k].1 as usize);
|
| 96 |
+
eprintln!(
|
| 97 |
+
" DIVERGE @tok {k}: ours[{os}..{oe}]={:?} ref[{rs}..{re}]={:?} ctx={:?}",
|
| 98 |
+
&corpus[os..oe],
|
| 99 |
+
&corpus[rs..re],
|
| 100 |
+
ctx(os.min(rs), oe.max(re))
|
| 101 |
+
);
|
| 102 |
+
"✗"
|
| 103 |
+
}
|
| 104 |
+
|
| 105 |
+
fn main() {
|
| 106 |
+
let (rn, rc, rb) = (
|
| 107 |
+
Regex::new(P_NUM).unwrap(),
|
| 108 |
+
Regex::new(P_CJK).unwrap(),
|
| 109 |
+
Regex::new(P_BIG).unwrap(),
|
| 110 |
+
);
|
| 111 |
+
let manifest = env!("CARGO_MANIFEST_DIR");
|
| 112 |
+
|
| 113 |
+
println!(
|
| 114 |
+
"{:<10} {:>7} {:>5} {:>8} {:>8} | {:>8} | {:>7} {:>4}",
|
| 115 |
+
"lang", "bytes", "b/tok", "clsSIMD", "fsmScal", "onig×3", "vsRef", "parity"
|
| 116 |
+
);
|
| 117 |
+
|
| 118 |
+
for (label, rel) in CORPORA {
|
| 119 |
+
let raw = match std::fs::read_to_string(format!("{manifest}/{rel}")) {
|
| 120 |
+
Ok(s) if !s.trim().is_empty() => s,
|
| 121 |
+
_ => {
|
| 122 |
+
println!("{label:<10} (skipped — {rel} missing)");
|
| 123 |
+
continue;
|
| 124 |
+
}
|
| 125 |
+
};
|
| 126 |
+
let mut c = raw.len().min(180_000);
|
| 127 |
+
while c > 0 && !raw.is_char_boundary(c) {
|
| 128 |
+
c -= 1;
|
| 129 |
+
}
|
| 130 |
+
let corpus = &raw[..c];
|
| 131 |
+
let text = corpus.as_bytes();
|
| 132 |
+
let n = text.len();
|
| 133 |
+
let iters = (4_000_000 / n).clamp(3, 150) as u32;
|
| 134 |
+
|
| 135 |
+
// parity: fsm_deepseek == composed 3-split Sequence
|
| 136 |
+
let reference = deepseek_ref(corpus, &rn, &rc, &rb);
|
| 137 |
+
let mut tags = vec![0u8; n];
|
| 138 |
+
classify::<Atoms>(text, &mut tags);
|
| 139 |
+
let mut ours = Vec::new();
|
| 140 |
+
fsm_deepseek(text, &tags, &mut ours);
|
| 141 |
+
let parity = report_diff(corpus, &ours, &reference);
|
| 142 |
+
let btok = n as f64 / ours.len().max(1) as f64;
|
| 143 |
+
|
| 144 |
+
// timing
|
| 145 |
+
let mut buf = Vec::with_capacity(ours.len());
|
| 146 |
+
let cls_simd = ns_per_byte(n, iters, || {
|
| 147 |
+
classify::<Atoms>(text, &mut tags);
|
| 148 |
+
tags[n / 2] as usize
|
| 149 |
+
});
|
| 150 |
+
let mut tsc = vec![0u8; n];
|
| 151 |
+
let _ = classify_scalar::<Atoms>; // (scalar classify measured in the cl100k bench; skip here)
|
| 152 |
+
let _ = &mut tsc;
|
| 153 |
+
classify::<Atoms>(text, &mut tags);
|
| 154 |
+
let fsm_scal = ns_per_byte(n, iters, || {
|
| 155 |
+
buf.clear();
|
| 156 |
+
fsm_deepseek(text, &tags, &mut buf);
|
| 157 |
+
buf.len()
|
| 158 |
+
});
|
| 159 |
+
let onig_ns = ns_per_byte(n, iters, || deepseek_ref(corpus, &rn, &rc, &rb).len());
|
| 160 |
+
|
| 161 |
+
let pipe = cls_simd + fsm_scal;
|
| 162 |
+
println!(
|
| 163 |
+
"{label:<10} {n:>7} {btok:>5.1} {cls_simd:>8.3} {fsm_scal:>8.3} | {onig_ns:>8.2} | {:>6.1}x {parity:>5}",
|
| 164 |
+
onig_ns / pipe
|
| 165 |
+
);
|
| 166 |
+
}
|
| 167 |
+
println!("\n(ns/byte, lower better; onig×3 = the composed Sequence reference. parity: fsm_deepseek == reference.)");
|
| 168 |
+
}
|