-
### What would you like to Propose?
~ Would like to add Damerau-levenshtein distance Algorithm in Dynamic Programming folder.
### Issue details
The Damerau–Levenshtein distance is a measure of th…
-
### Describe the feature you'd like
When searching something, I sometimes don't find what I need, because I have a typo or just named the title slightly different. An example would be if I search
se…
-
Since the transformer lexicon is so big, sometimes exact matches are still nonsensical predictions in context, particularly for short words. Sometimes this happens when the words aren't even exact mat…
-
Add built in functions to compare texts in popular algorithms:
- Jaro
- Jaro-Winkler
- Levenshtein
- Damerau-Levenshtein
- Hamming Distance (simple i know)
- Cosine Similarity
- ....
-
### Is your feature request related to a problem?
Feature request #2385 discusses fuzzy string matching that was implemented in PR #1904.
@tobiemh mentioned three not-yet-implemented string distance…
-
# Back To Back SWE
The solution uses bottom-up DP approach to solving the question. The solution provided now uses Top-Down Memoized approach.
#### Your email registered on BackToBackSWE :
…
-
Queries with Levenshtein distance 2 (%%) are not returning all matching records especially exact matches but Levenshtein distance 1 (%) is working correctly.
Example, Query1: '@first_name:"Heidi" @l…
-
Just wanted to ask if you considered using FST as the dictionary. It allows efficient fuzzy queries with levenshtein distance for spelling correction. Look ups are also quite fast, and it provides pre…
-
Let's get a fuzzy match for autocomplete, say if 20% of characters match, then still suggest it with autocomplete.
-
DreamBerd has the wonderful `var var` syntax. This has a Levenshtein distance of just 2 to "Jar Jar" Binks, a clumsy character in Star Wars.
**Proposal**
Introduce the new `jar jar` syntax for var…