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
Resolve Support Tickets 2x Faster​ with ServoDesk Icon
Resolve Support Tickets 2x Faster​ with ServoDesk

Full access to Enterprise features. No credit card required.

What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for free
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