A simple Kurdish spell checker using Lavenshtein distance
-
Updated
Nov 20, 2017 - C#
#
lavenshtein
Here are 5 public repositories matching this topic...
Group similar strings as a cluster by doing a fuzzy string match
-
Updated
Mar 15, 2019 - Jupyter Notebook
A search engine that takes keyword queries as input and retrieves a ranked list of relevant results as output. It scraps a few thousand pages from one of the seed Wiki pages and uses Elasticsearch for a full-text search engine.
react search-engine elasticsearch information-retrieval material-ui web-scraping marvel elasticsearch-client scrapy-crawler nodejs-server wikipedia-crawler lavenshtein okapi-bm25 dirichlet-smoothing marvel-wiki
-
Updated
Jan 13, 2023 - JavaScript
FuzzyScorer is a .NET library that analyzes text and scores words by frequency or visual similarity using Levenshtein distance, making it ideal for word clouds, typo handling, and fuzzy matching in applications like surveys, OCR correction, and spam filtering.
fuzzy-matching string-similarity ocr-recognition duplicate-detection lavenshtein word-frequency typo-tolerant lavenshtein-distance word-scorer
-
Updated
Mar 27, 2026 - C#
Improve this page
Add a description, image, and links to the lavenshtein topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the lavenshtein topic, visit your repo's landing page and select "manage topics."