{"library":"fast-fuzzy","type":"library","category":null,"description":"fast-fuzzy is a compact and high-performance JavaScript utility for fuzzy string matching, currently at version 1.12.0. It implements a modified Levenshtein distance algorithm, specifically Damerau-Levenshtein distance, which is more forgiving of transpositions. The library preprocesses inputs through UTF-8 normalization, optional lowercasing, symbol stripping, and whitespace normalization to ensure robust matching. It scores matches between 0 and 1, returning results sorted by score, then by match earliness, and finally by length proximity to the search term. For efficiency, especially when searching the same set of candidates repeatedly, it internally uses a trie data structure to cache work and prune non-matching subtrees, significantly outperforming brute-force approaches. While it offers a simple `search` function for one-off queries, the `Searcher` class is recommended for persistent collections due to its trie caching. The project appears to have a steady, though not strictly scheduled, release cadence, with ongoing maintenance.","language":"javascript","status":"active","version":"1.12.0","tags":["javascript","fast","fuzzy","search","damerau","levenshtein","unicode","partial","match","typescript"],"last_verified":"Wed May 27","install":[{"cmd":"npm install fast-fuzzy","imports":["import { search } from 'fast-fuzzy'","import { Searcher } from 'fast-fuzzy'","import { fuzzy } from 'fast-fuzzy'"]},{"cmd":"yarn add fast-fuzzy","imports":[]},{"cmd":"pnpm add fast-fuzzy","imports":[]}],"homepage":null,"github":"https://github.com/EthanRutherford/fast-fuzzy","docs":null,"changelog":null,"pypi":null,"npm":"https://www.npmjs.com/package/fast-fuzzy","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":{"summary":{"python_range":"18–22","success_rate":0,"avg_install_s":null,"avg_import_s":null,"wheel_type":null},"url":"https://checklist.day/v1/registry/fast-fuzzy/compatibility"}}