snowykami/meilisearch
1
0
Fork 0
mirror of https://github.com/meilisearch/meilisearch.git synced 2024-11-23 02:27:40 +08:00
Code Issues Actions 9 Packages Projects Releases Wiki Activity

Merge pull request #120 from Kerollmops/custom-log10-function

Browse Source 
Optimize the SumOfTypos criterion
This commit is contained in:
Clément Renault 2019-02-23 19:01:12 +01:00 committed by GitHub
commit 24f265a963
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 19 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
src/rank/criterion/sum_of_typos.rs
View File

@ -5,22 +5,33 @@ use slice_group_by::GroupBy;
use crate::rank::criterion::Criterion;
use crate::rank::RawDocument;
// This function is a wrong logarithmic 10 function.
// It is safe to panic on input number higher than 3,
// the number of typos is never bigger than that.
#[inline]
fn sum_matches_typos(query_index: &[u32], distance: &[u8]) -> isize {
let mut number_words = 0.0;
fn custom_log10(n: u8) -> f32 {
match n {
0 => 0.0, // log(1)
1 => 0.30102, // log(2)
2 => 0.47712, // log(3)
3 => 0.60205, // log(4)
_ => panic!("invalid number"),
}
}
#[inline]
fn sum_matches_typos(query_index: &[u32], distance: &[u8]) -> usize {
let mut number_words = 0;
let mut sum_typos = 0.0;
let mut index = 0;
for group in query_index.linear_group() {
let typo = distance[index] as f32;
sum_typos += (typo + 1.0).log10();
number_words += 1.0_f32;
sum_typos += custom_log10(distance[index]);
number_words += 1;
index += group.len();
}
let out = number_words / (sum_typos + 1.0);
(out * 1000.0) as isize
(number_words as f32 / (sum_typos + 1.0) * 1000.0) as usize
}
#[derive(Debug, Clone, Copy)]