Search results
169 packages found
Auto Correct City names (AutoCorrects Top Indian Cities, for Now), Give a incorrect city name and get the most relevant city name
- leven
- levenshtein
- algo
- algorithm
- string
- strings
- difference
- diff
- Cities
- city
- Indian cities
- Indian city
- India
- similar
- View more
Find alternatives to specified keyword
A quick and easy Damerau Levenshtein implementation (not a Levenshtein only operation which doesn't do look aheads or transpositions).
Calculate the Levenshtein distance between two strings.
Potsiu! is a simple utility function that allows you to update indexes of specific positions on a string after you apply some transformation to it. It is quite handy if you have data in which string indexes are specified, but for some reason you want to p
- potsiu
- transform
- string
- index
- updater
- utility
- string manipulation
- algorithm
- levenshtein
- context
- surroundings
- similarity
Compare two strings using multiple methods (Jaro-Winkler Algorithm,Cosine Similarity,Levenshtein Algorithm)
Fast implementation of the Levenshtein edit distance
small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance
General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.
- natural
- language
- porter
- lancaster
- stemmer
- bayes
- classifier
- phonetic
- metaphone
- inflector
- wordnet
- tf-idf
- logistic
- regression
- View more
Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.
- string
- levenshtein
- hamming distance
- rope
- longest common substring
- substring
- longest common subsequence
- trie
- boyer moore
- palindrom
Find the difference between two arrays and compute the minimal steps to transform one array to another.
A sort function for string arrays based on Levenshtein distance.
General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.
- natural
- language
- porter
- lancaster
- stemmer
- bayes
- classifier
- phonetic
- metaphone
- inflector
- wordnet
- tf-idf
- logistic
- regression
- View more
Levenshtein algorithm module
A method to detect the levenshtein edits between strings
library for fuzzy search
- fuzzy
- search
- levenshtein
- damerau-levenshtein
- hamming distance
- longest subsequence
- edit distance
- string matching
- fuzzy matching
Compute the Levenshtein distance for string comparison
Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power
Heuristic Distance/Similarity Between Strings (sift4 and levenshtein distance)
Searches a haystack for all best possible matches of needle, returning their position and Levenshtein distance.