Search Results for "levenshtein distance"
Sort By:
Showing 13 open source projects for "levenshtein distance"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
-
Start building the next generation of GenAI apps todayMongoDB Atlas is a fully-managed developer data platform built by developers, for developers. With tight integration to Google Cloud services such as Vertex AI and BigQuery, you can accelerate application deployment to stay at the forefront of AI innovation.
-
1
natural
General natural language facilities for node
"Natural" is a general natural language facility for nodejs. It offers a broad range of functionalities for natural language processing. Tokenizing, stemming, classification, phonetics, tf-idf, WordNet, string similarity, and some inflections are currently supported. It’s still in the early stages, so we’re very interested in bug reports, contributions and the like. Note that many algorithms from Rob Ellis’s node-nltools are being merged into this project and will be maintained from here... -
2
Smart Find
SmartFind: Fuzzy file search and copy utility for locating files
SmartFind is an efficient file search and copy utility that uses fuzzy matching to locate files even when you don't remember the exact filenames. It calculates the similarity between filenames and search terms using the Levenshtein distance algorithm, allowing you to find files with partial or slightly varied names. With customizable search options and similarity thresholds, SmartFind gives you control over the matching process. It supports single-directory and recursive search... -
3
NLP.js
An NLP library for building bots
NLP.js is an NLP library for building bots, with entity extraction, sentiment analysis, automatic language identifier, and much more. "NLP.js" is a general natural language utility for nodejs. Search the best substring of a string with less Levenshtein distance to a given pattern. Get stemmers and tokenizers for several languages. Sentiment Analysis for phrases (with negation support). Named Entity Recognition and management, multi-language support, and acceptance of similar strings, so... -
4
Lexical Analyzer Generator Quex
Generator of lexical analyzers in C and C++. Unicode Supported.
The goal of this project is to provide a generator for lexical analyzers of maximum computational efficiency and maximum range of applications. This includes the support for Unicode (UTF8, UTF16, ...) and a large variety of other encodings directly and via nested converters such as ICU(tm) and IConv. Sophisticated buffer handling allows to operate on plain file streams, on sockets, or manually fed buffer content. 'Ready-to-build' examples explain related concepts and facilitate practical... -
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
5
java-string-similarity
Implementation of various string similarity and distance algorithms
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity. A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. The main characteristics of each implemented algorithm are presented... -
6
levin
in-memory key value server with fuzzy search capabilities
Levin is an event-based key/value server based on radix-tree (space optimized trie). Key search can be performed with an approximate key matching algorithm based on Levenshtein edit distance. -
7
FuzzyWuzzy
Fuzzy string matching in Python
We’ve made it our mission to pull in event tickets from every corner of the internet, showing you them all on the same screen so you can compare them and get to your game/concert/show as quickly as possible. Of course, a big problem with most corners of the internet is labeling. One of our most consistently frustrating issues is trying to figure out whether two ticket listings are for the same real-life event (that is, without enlisting the help of our army of interns). To pick an example... -
8
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
9
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
Free CRM Software With Something for EveryoneThink CRM software is just about contact management? Think again. HubSpot CRM has free tools for everyone on your team, and it’s 100% free. Here’s how our free CRM solution makes your job easier.
-
10
fuzzy-matching
Fuzzy and streaming matching of string sets
The fuzzy-matching library provides an OmniMark pattern function that attempts to approximately match the input prefix against any of the given target strings. The allowed Damerau–Levenshtein distance from each target string is user-specified. This distance equals the minimum number of character deletions, insertions, replacements, and transpositions required to transform the target string into the input. Each of the four transformations can be individually weighed or completely disallowed. -
11
A Java package that provides several computations related to the edit distance of strings. Other than the basic Levenshtein, this algorithm can rearange words when comparing. The class can also provide details of how words could be transformed.
-
12
Implementation of Damerau-Levenshtein fuzzy string matching in Java. Returns the distance adding one point per character insert, deletion, mismatche and swap.. This is an extension of apache/commons/lang/StringUtils.getLevenshteinDistance()
-
13
jAlgorithms is a project mainly for educational purposes. It contains some of the popular algorithms and data structures.
- Previous
- You're on page 1
- Next