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.

Project Activity

See All Activity >

Categories

Libraries

License

BSD License

Follow fuzzy-matching

fuzzy-matching Web Site

Other Useful Business Software
Our Free Plans just got better! | Auth0 Icon
Our Free Plans just got better! | Auth0

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of fuzzy-matching!

Additional Project Details

Registered

2013-07-31