Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Tip
The owner of this PR can publish a preview release by commenting
/publish
in this PR. Afterwards, anyone can try it out by runningpnpm add radashi@pr<PR_NUMBER>
.Summary
This function calculates the “Levenshtein distance” between two strings, which is a fancy way of saying how many characters did not match. Note that it's case-sensitive.
Its most common use case is in quick and dirty “fuzzy matching” solutions. By passing the search query as one argument and the possible match as the other argument, you can score each possible match to determine which is most similar to the search query.
For any code change,
Does this PR introduce a breaking change?
No
Bundle impact
src/string/similarity.ts
Footnotes
Function size includes the
import
dependencies of the function. ↩