Search results
151 packages found
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
Simple binary search algorithm implementation
Knuth-Morris-Pratt string searching algorithm.
Tests cases for various tree layout algorithms
An almost universal implementation of A* search algorithm in JavaScript
unified-doc micromatch search algorithm.
- unified
- doc
- search
- micromatch
- document
- file
- content
- unist
- hast
- nlp
- algorithm
- glob
- glob-pattern
- glob-matching
- View more
An implementation of the Knuth-Morris-Pratt string searching algorithm.
A collection of string matching algorithms built with React Select in mind
- distance
- filter
- fuzzy
- Jaro-Winkler
- Levenshtein
- match
- options
- proximity
- search
- similar
- similarity
- string
- subsequence
- substitutions
- View more
High-performance 2D spatial index for rectangles (based on R*-tree with bulk loading and bulk insertion algorithms)
searching algorithms for arrays
A Xenoblade 2 Merc Missions algorithm to efficiently compose a Blade squad
Typescript implementation of the soundex phonetic search algorithm.
A collection of algorithm and common data manipulation tools.
this is a function to construct tree string to search pattern
Universal js which implement red black tree
A searching library for Node.js & javascript made based on well known algorithmes included : Linear Search , Binary Search , Jump Search , etc..
Library to parse and generate Goggles.
Binary search is a searching algorithm that works on sorted data. Binary searches check the middle value to see whether the desired value is greater or smaller than it. If the desired value is smaller, this algorithm can search the smaller parts, or it ca
A generic beam search optimization algorithm