One string at a time, does not compute score / rank.
JavaScriptMIT Licensedormant
7 projectsText Search › Fuzzy search
One string at a time, does not compute score / rank.
JavaScriptMIT Licensedormant
Find misspellings, e.g. missipissi -> Missisipi, Commercial usage costs $42.
JavaScriptOtherdormant
Index-free, can highlight matches.
JavaScriptMIT Licensedormant
Quicksilver algorithm, prioritizes matches at start of word for command abbreviations (e.g. gp -> git push). One string at a time.
JavaScriptMIT Licensedormant
With stateful index.
JavaScriptISC Licensedormant
Another quicksilver-based lib, tweaked for long strings. Built-in list filtering and sorting, or 1.2 kB for single-string scoring.
JavaScriptMIT Licensedormant
Matches one string at a time, tree-shakeable scores and match highlighting. total, or ~150 bytes for hasMatch only.
JavaScriptMIT Licenseslowing