langid_rs/
lib.rs

1use std::collections::{HashMap, HashSet};
2use std::io::{self, Cursor, Read, Seek, SeekFrom};
3
4#[derive(Debug)]
5pub struct Model {
6    tk_output: HashMap<u16, Vec<i32>>, // Transition table
7    nb_numfeats: usize,
8    tk_nextmove: Vec<u16>,
9    norm_probs: bool,
10    data: ModelData,
11    used_data: Option<ModelData>,
12}
13
14#[derive(Debug)]
15pub struct ModelData {
16    pub nb_classes: Vec<String>, // List of class names
17    pub nb_ptc: Vec<Vec<f32>>,   // 2D array
18    pub nb_pc: Vec<f32>,         // 1D array
19}
20
21pub enum Error {
22    UnknownLanguageCode(String),
23    NoLanguage,
24}
25
26impl Model {
27    fn data(&self) -> &ModelData {
28        if let Some(data) = &self.used_data {
29            data
30        } else {
31            &self.data
32        }
33    }
34}
35
36impl Model {
37    pub fn set_langs(&mut self, langs: Option<HashSet<String>>) -> Result<(), Error> {
38        if let Some(langs) = langs {
39            if langs.len() < 2 {
40                return Err(Error::NoLanguage);
41            }
42            let unknown = langs
43                .iter()
44                .find(|lang| !self.data.nb_classes.contains(&lang));
45            if let Some(lang) = unknown {
46                return Err(Error::UnknownLanguageCode(lang.to_owned()));
47            }
48            let subset_mask = self
49                .data
50                .nb_classes
51                .iter()
52                .map(|s| langs.contains(s))
53                .collect::<Vec<_>>();
54            let nb_classes = self
55                .data
56                .nb_classes
57                .iter()
58                .filter(|s| langs.contains(*s))
59                .cloned()
60                .collect::<Vec<_>>();
61            let nb_pc = self
62                .data
63                .nb_pc
64                .iter()
65                .zip(&subset_mask)
66                .filter(|(_, m)| **m)
67                .map(|v| *v.0)
68                .collect::<Vec<_>>();
69
70            let nb_ptc = self
71                .data
72                .nb_ptc
73                .iter()
74                .map(|v| {
75                    v.iter()
76                        .zip(&subset_mask)
77                        .filter(|(_, m)| **m)
78                        .map(|v| *v.0)
79                        .collect::<Vec<_>>()
80                })
81                .collect::<Vec<_>>();
82            self.used_data = Some(ModelData {
83                nb_classes,
84                nb_ptc,
85                nb_pc,
86            });
87        } else {
88            self.used_data = None;
89        }
90        Ok(())
91    }
92
93    fn apply_norm_probs(&self, pd: Vec<f32>) -> Vec<f32> {
94        if self.norm_probs {
95            todo!("pd = 1/np.exp(pd[None,:] - pd[:,None]).sum(1)")
96        } else {
97            pd
98        }
99    }
100
101    /// Return a list of languages in order of likelihood.
102    pub fn rank(&self, text: &str) -> Vec<(&str, f32)> {
103        let fv: Vec<u16> = self.instance2fv(text);
104        let probs: Vec<f32> = self.apply_norm_probs(self.nb_classprobs(fv));
105        let mut class_probs: Vec<(&str, f32)> = self
106            .data()
107            .nb_classes
108            .iter()
109            .map(|class| class.as_str())
110            .zip(probs.into_iter())
111            .collect();
112
113        class_probs.sort_by(|a, b| b.1.partial_cmp(&a.1).unwrap_or(std::cmp::Ordering::Equal));
114        class_probs
115    }
116
117    /// Classify an instance.
118    /// Will return None if no language is detected.
119    pub fn classify(&self, text: &str) -> Option<(&str, f32)> {
120        let fv = self.instance2fv(text);
121        let probs = self.apply_norm_probs(self.nb_classprobs(fv));
122        let (max_index, max_prob) = probs
123            .iter()
124            .enumerate()
125            .fold(None, |max, (idx, &prob)| match max {
126                None => Some((idx, prob)),
127                Some((max_idx, max_val)) => {
128                    if prob > max_val {
129                        Some((idx, prob))
130                    } else {
131                        Some((max_idx, max_val))
132                    }
133                }
134            })
135            .unzip();
136        let (max_index, max_prob) = (max_index?, max_prob?);
137
138        self.data()
139            .nb_classes
140            .get(max_index)
141            .map(|class| (class.as_str(), max_prob))
142    }
143
144    fn nb_classprobs(&self, fv: Vec<u16>) -> Vec<f32> {
145        // let pdc = np.dot(fv, self.data.nb_ptc);
146        // pdc + self.data.nb_pc
147
148        // dot
149        let m = fv.len();
150        let n = self.data().nb_pc.len();
151
152        let mut pdc = vec![0f32; n];
153
154        for i in 0..m {
155            let fv_val = fv[i] as f32;
156            for j in 0..n {
157                pdc[j] += fv_val * self.data().nb_ptc[i][j];
158            }
159        }
160
161        // add
162        for j in 0..n {
163            pdc[j] += self.data().nb_pc[j];
164        }
165
166        pdc
167    }
168
169    fn instance2fv(&self, text: &str) -> Vec<u16> {
170        let indexes = text
171            .chars()
172            .fold((0usize, Vec::new()), |(state, mut acc), letter| {
173                let new_state = self.tk_nextmove[(state << 8) + letter as usize];
174                let new_state_u = new_state as usize;
175                let output = self.tk_output.get(&new_state).cloned().unwrap_or_default();
176                acc.extend(output);
177                (new_state_u, acc)
178            })
179            .1;
180        let mut arr = vec![0; self.nb_numfeats];
181
182        let counts = counter(&indexes);
183
184        for (index, value) in counts {
185            arr[index as usize] = value;
186        }
187        arr
188    }
189}
190
191fn counter(indexes: &Vec<i32>) -> HashMap<i32, u16> {
192    let mut counts = HashMap::new();
193
194    for inner_vec in indexes {
195        *counts.entry(*inner_vec).or_insert(0) += 1;
196    }
197
198    counts
199}
200fn read_u32(reader: &mut impl Read) -> io::Result<u32> {
201    let mut buf = [0u8; 4];
202    reader.read_exact(&mut buf)?;
203    Ok(u32::from_le_bytes(buf))
204}
205
206fn read_f32_vec(reader: &mut impl Read, len: usize) -> io::Result<Vec<f32>> {
207    let mut buf = vec![0u8; len * 4];
208    reader.read_exact(&mut buf)?;
209    let floats = buf
210        .chunks_exact(4)
211        .map(|b| f32::from_le_bytes(b.try_into().unwrap()))
212        .collect();
213    Ok(floats)
214}
215
216fn read_u16_vec(reader: &mut impl Read, len: usize) -> io::Result<Vec<u16>> {
217    let mut buf = vec![0u8; len * 2];
218    reader.read_exact(&mut buf)?;
219    let floats = buf
220        .chunks_exact(2)
221        .map(|b| u16::from_le_bytes(b.try_into().unwrap()))
222        .collect();
223    Ok(floats)
224}
225
226fn read_string(reader: &mut impl Read) -> io::Result<String> {
227    let len = read_u32(reader)? as usize;
228    let mut buf = vec![0u8; len];
229    reader.read_exact(&mut buf)?;
230    Ok(String::from_utf8(buf).expect("Invalid UTF-8"))
231}
232
233fn read_i32_vec(reader: &mut impl Read, len: usize) -> io::Result<Vec<i32>> {
234    let mut buf = vec![0u8; len * 4];
235    reader.read_exact(&mut buf)?;
236    let vals = buf
237        .chunks_exact(4)
238        .map(|b| i32::from_le_bytes(b.try_into().unwrap()))
239        .collect();
240    Ok(vals)
241}
242
243impl Model {
244    pub fn load() -> io::Result<Self> {
245        let mut reader = Cursor::new(include_bytes!("model.bin"));
246
247        let rows = read_u32(&mut reader)? as usize;
248        let cols = read_u32(&mut reader)? as usize;
249        let nb_ptc_flat = read_f32_vec(&mut reader, rows * cols)?;
250        let nb_ptc: Vec<Vec<f32>> = nb_ptc_flat
251            .chunks_exact(cols)
252            .map(|row| row.to_vec())
253            .collect();
254
255        let nb_pc_len = read_u32(&mut reader)? as usize;
256        let nb_pc = read_f32_vec(&mut reader, nb_pc_len)?;
257
258        let tk_nextmove_len = read_u32(&mut reader)? as usize;
259        let tk_nextmove = read_u16_vec(&mut reader, tk_nextmove_len)?;
260
261        let nb_class_count = read_u32(&mut reader)? as usize;
262        let mut nb_classes = Vec::with_capacity(nb_class_count);
263        for _ in 0..nb_class_count {
264            nb_classes.push(read_string(&mut reader)?);
265        }
266
267        let tk_output_count = read_u32(&mut reader)? as usize;
268        let mut tk_output = HashMap::with_capacity(tk_output_count);
269        for _ in 0..tk_output_count {
270            let key = read_u32(&mut reader)?;
271            let key = match u16::try_from(key) {
272                Ok(v) => v,
273                Err(_) => unreachable!("Key does not fit in u16"),
274            };
275            let val_len = read_u32(&mut reader)? as usize;
276            let val = read_i32_vec(&mut reader, val_len)?;
277            tk_output.insert(key, val);
278        }
279
280        let nb_numfeats = nb_ptc.iter().map(|v| v.len()).sum::<usize>() / nb_pc.len();
281        assert_eq!(bytes_remaining(&mut reader)?, 0);
282        Ok(Self {
283            norm_probs: false,
284            used_data: None,
285            nb_numfeats,
286            data: ModelData {
287                nb_classes,
288                nb_ptc,
289                nb_pc,
290            },
291            tk_nextmove,
292            tk_output,
293        })
294    }
295}
296
297fn bytes_remaining<R: Read + Seek>(reader: &mut R) -> std::io::Result<u64> {
298    let current = reader.seek(SeekFrom::Current(0))?;
299    let end = reader.seek(SeekFrom::End(0))?;
300    reader.seek(SeekFrom::Start(current))?; // Restore position
301    Ok(end - current)
302}