The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning. Learn more →
C# Levenshtein Projects
-
SymSpell
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
-
Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
Project mention: Should you combine edit distance "spell check" algorithms with phonetic matching algorithms for robust keyword finding? | /r/AskComputerScience | 2023-11-07The SimSpell algorithm uses deletions to determine edit distance of the input query word compared to a dictionary of correctly spelled words. The Double Metaphone algorithm (or other phonetic algorithms) convert the words to phonetic versions (phonetic "hashes" basically), and you then search based on the input phonetic hash matching the dictionary of phonetic hashes.
C# Levenshtein related posts
- Should you combine edit distance "spell check" algorithms with phonetic matching algorithms for robust keyword finding?
- Help with deep learning project "autocorrection"
- Spellcheck and Levenshtein distance
- Auto correct/Auto complete feature
- SymSpell: 1M times faster spelling correction
- Hacker News top posts: Mar 6, 2022
- Fuzzy Name Matching in Postgres
-
A note from our sponsor - WorkOS
workos.com | 19 Apr 2024
Index
Project | Stars | |
---|---|---|
1 | SymSpell | 3,032 |
2 | Quickenshtein | 272 |