Search Results for "levenshtein distance"
Sort By:
Showing 18 open source projects for "levenshtein distance"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Auth0 B2B Essentials: SSO, MFA, and RBAC Built InAuth0's B2B Essentials plan gives you everything you need to ship secure multi-tenant apps. Unlimited orgs, enterprise SSO, RBAC, audit log streaming, and higher auth and API limits included. Add on M2M tokens, enterprise MFA, or additional SSO connections as you scale.
-
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
SqliteFuzzyPlusExtension
Sqlite Fuzzy Extension adds dozens of functions to SQLite3
The ultimate fuzzy SQLite extension, which includes most of the well known fuzzy libraries and methods like Levenshtein, DamerauLevenshtein, Hamming, Jaro-Winkler, Soundex, Caverphone and much more. It includes libraries like SQLean and Edlib. The documentation has many examples, and the open source code includes example usage for C, C++, and C# projects. -
3
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, intelligently compares filenames, and can automatically copy matched files to a specified destination. ... -
4
... # Teacher Name Handling * **Raw names preserved** exactly as typed in **Sheet1** (no trimming or cleaning when exporting). * **Fuzzy matching** to FET teachers using normalization + **Levenshtein** distance to suggest the closest match. * A helper sheet **`Teacher_Map`** appears **only when mismatches exist**; it offers a dropdown (validated list) of official FET names pulled from **`FET_Teachers`**. * Auto-creates/updates the **`FET_Teachers`** sheet and a named range for data validation. # FET XML Processing * **Clears all space constraints** and **keeps only** `C
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
5
Essential Excel Add-In is a Microsoft Excel Add-In, written in VBA, that contains useful User Defined Functions (UDFs) and macros to performs a number of different tasks that either Excel does not provide (Regular Expressions (RegEx), improved VLookUp).
-
6
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... -
7
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 the introduced text does not need to be exact. Natural Language Processing Classifier, to classify an utterance into intents. ... -
8
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. -
9
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. -
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
10
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... -
11
fuzzysearch
Tiny and blazing-fast fuzzy search in JavaScript
fuzzysearch is a tiny, blazing-fast fuzzy search library for JavaScript that checks whether a “needle” string can be found inside a “haystack” string in order, but not necessarily contiguously. It implements a simplified fuzzy searching algorithm that does not use Levenshtein distance; instead it returns a boolean indicating whether all characters of the needle appear in sequence within the haystack. This makes it ideal for filtering lists or autocomplete suggestions quickly based on incomplete user input. Because it operates with a very small algorithmic footprint, it is both lightweight in size and extremely fast in practice. ... -
12
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
13
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
14
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. -
15
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.
-
16
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()
-
17
jAlgorithms is a project mainly for educational purposes. It contains some of the popular algorithms and data structures.
-
18
Nimble dictionary is a light weighted implementation of a dictionary. It hides the details of a multi-branch tree structure of dictionary and has a very simple interface. It allows exact match as well as search within some edit (Levenshtein) distance.
- Previous
- You're on page 1
- Next
