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
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
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