I ported the SymSpell Spellcheck algorithm to KMP....
# feed
a
I ported the SymSpell Spellcheck algorithm to KMP. It's a pretty cool algorithm with a lookup time of O(1) (where n is dictonary size). There's a Compose sample app that runs on both Desktop and WASMjs. https://github.com/Wavesonics/SymSpellKt
๐Ÿ‘ 1
๐ŸŽ‰ 2
.wasm 2
๐Ÿ’ช 1
๐Ÿคฏ 1
K 14
s
This looks really useful! ๐Ÿ™‚ You bring yet again new life to another seemingly abandoned Java library. ๐Ÿ‘ Thank you for helping the ecosystem with your useful ports.
I suggest to link the GitHub pages wasmJS live demo in the projects description and README. While you are at it: You also derived one typo in the README, which is โ€ždistnaceโ€œ ๐Ÿ˜‰
a
I have it up here, but be warned, it takes a long time to load! https://wavesonics.github.io/SymSpellKt
s
So you did not link it on purpose ๐Ÿ˜„
a
ya, it doesn't feel like a very good showing at the moment ๐Ÿ˜›
๐Ÿ‘ 1
s
But after it's loaded it works really good. Nice work, again. I just made me a task to include this to improve the search functionality in Ashampoo Photos ๐Ÿ™‚
a
nice!
j
Oh, wasnt even aware it were algorithms for this ๐Ÿ˜ Looks awesome, will probably integrate it into my app as well.
s
I only knew Levenshtein distance so far, but that has a rather short implementation and this SymSpell looks really sophisticated as it takes the concept further ๐Ÿ˜„ I read
WeightedDamerauLevenshteinDistance
and I know that I don't want to wrap my head around that. ;)