Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
JavaScript
717
47
MIT License
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of yomguithereal/talisman
Fastest HTML entities encode/decode library.
BDD/TDD assertion library for node.js and the browser. Test framework agnostic.
CSV parsing implementing the Node.js `stream.Transform` API
simple, flexible, fun test framework
A deep deletion module for node (like `rm -rf`)
A Long class for representing a 64-bit two's-complement integer value.
Curated collection of data structures for the JavaScript/TypeScript.
Higher order iterator library for JavaScript/TypeScript.
Typical random-related functions for JavaScript.
Just an eslint config.
Citation.js converts formats like BibTeX, Wikidata JSON and ContentMine JSON to CSL-JSON to convert to other formats like APA, Vancouver and back to BibTeX.
A mature CSV toolset with simple api, full of options and tested against large datasets.
Benchmark your code.
Seeded random number generator for Javascript.
Support the repos that depend on yomguithereal/talisman
High-performance and memory efficient native C++ text similarity algorithms for Node.js
A library that focuses on edit distance and similarity algorithms for string
An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Fastest Levenshtein distance implementation in JS.
Fastest Levenshtein distance implementation in JS.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Utilitaires pour traitement des adresses
Fastest Levenshtein distance implementation in JS.
Lonero configs for Lamassu ATM Client
bitcoin atm client server protocol module
bitcoin atm client server protocol module
Fastest Levenshtein distance implementation in JS.
bitcoin atm client server protocol module
bitcoin atm client server protocol module
Attach interpolation values given a road network and address points
Levenshtein distance
A very fast JavaScript implementation of Levenshtein distance for the k <= 1 case.
A Mongoose plugin for weighted search and pagination
Misspells and modifies text to seem like it was written by a stereotypical 'bimbo'.
Natural language processing.
Take command of your media
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Utilitaires pour traitement des adresses
Top contributors
Yomguithereal
544 contributions
paulgirard
3 contributions
ajmeese7
1 contributions
forivall
1 contributions
mvasilkov
1 contributions
mikehenrty
1 contributions
Fil
1 contributions
cbbfcd
1 contributions
jfseb
1 contributions
kakiac
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet