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
Gemini 3 and 200+ AI Models on One Platform Icon
Gemini 3 and 200+ AI Models on One Platform

Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
Start 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