asklyphe-public/asklyphe
asklyphe-public/asklyphe
1
0
Fork 1
Code Issues Pull requests 2 Projects Releases Packages Wiki Activity Actions

weight levenshtein distance calculation to prefer replacement over addition/removal

Browse source
This commit is contained in:
Book-reader 2025-05-10 02:28:16 +12:00
parent 26f5196138
commit b91674678e
1 changed files with 3 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
asklyphe-frontend/src/spellcheck.rs
View file

@ -6,6 +6,7 @@ use std::sync::Mutex;
// how to generate words.txt: // how to generate words.txt:
// clone https://github.com/en-wl/wordlist && cd wordlist // clone https://github.com/en-wl/wordlist && cd wordlist
// make
// ./scowl wl --deaccent > words0.txt // ./scowl wl --deaccent > words0.txt
// filtered with this python script: // filtered with this python script:
// ----------------------------------- // -----------------------------------
@ -195,8 +196,8 @@ fn levenshtein_distance(a: &str, other: &str) -> usize {
// TODO: make addition/subtraction 1 more expensive than replacement, presumably by adding '+ 1' to 2/3 of these // TODO: make addition/subtraction 1 more expensive than replacement, presumably by adding '+ 1' to 2/3 of these
// motivation: honex from bee movie script is turned into hone instead of honey, this will also generally improve results & is what wikipedia says to do (best reason) // motivation: honex from bee movie script is turned into hone instead of honey, this will also generally improve results & is what wikipedia says to do (best reason)
dist[j] = 1 + cmp::min( dist[j] = 1 + cmp::min(
dist.get(j - 1).unwrap(), *dist.get(j - 1).unwrap() + 1,
cmp::min(dist_prev.get(j).unwrap(), dist_prev.get(j - 1).unwrap())); cmp::min(*dist_prev.get(j).unwrap() + 1, *dist_prev.get(j - 1).unwrap()));
} }
} }
mem::swap(&mut dist, &mut dist_prev); mem::swap(&mut dist, &mut dist_prev);