trie VS uFuzzy

If youre interested in a TypeScript fork of this that also supports deletion, see here: https://github.com/shortwave/trie

There are also a couple of bug fixes in there

Tries are fun structures!

However, for autocomplete you often want a weighted Trie because you have extra information you want to weight nodes by. An example with contacts is that you often want recent and frequent contacts.

My company has an open source trie implementation here for a client to do weighted contact auto complete: https://github.com/shortwave/trie

Thank you. We need more libs like that. I just researched the field yesterday and https://github.com/leeoniya/uFuzzy looked pretty good. But there is a gap in the market of such libs. Just few allow to send the whole html document, serialize and deserialize index to be used in browser, highlighting the matches is desired feature.

Most importantly very few fuzzy search libs can get a simple substring match as a priority, which is understandable but not helpful. Imagine searching for “xample” and not having “example” among the results.

interesting, i made something much more stupid but brutally effective: https://github.com/leeoniya/uFuzzy

i guess if you wanted to do sorting by contact frequency you can just keep the original haystack sorted by frequency, and get Richard match first.

allow me to self-promote https://github.com/leeoniya/uFuzzy

Keep the tech simple and minimal. Just the basics: javascript, css, HTML. No react or other frameworks. No tech for tech's sake. I did use one very excellent search library uFuzzy.

maybe habit, maybe less devDependencies, maybe wanting to hand-author a readable/commented form of https://github.com/leeoniya/uFuzzy/blob/main/dist/uFuzzy.d.ts?