11 releases

0.3.7 Oct 4, 2020
0.3.6 Oct 3, 2020
0.3.5 Jul 5, 2020
0.3.4 Feb 23, 2020
0.1.0 Mar 2, 2019

#32 in Text processing

Download history 16595/week @ 2023-11-21 20720/week @ 2023-11-28 19223/week @ 2023-12-05 22525/week @ 2023-12-12 11653/week @ 2023-12-19 10782/week @ 2023-12-26 15135/week @ 2024-01-02 17372/week @ 2024-01-09 18750/week @ 2024-01-16 21180/week @ 2024-01-23 19785/week @ 2024-01-30 21424/week @ 2024-02-06 20353/week @ 2024-02-13 22634/week @ 2024-02-20 28700/week @ 2024-02-27 25332/week @ 2024-03-05

100,906 downloads per month
Used in 331 crates (102 directly)

MIT license

67KB
1.5K SLoC

Crates.io

Fuzzy Matcher

Fuzzy matching algorithm(s) in Rust!

Usage

In your Cargo.toml add the following:

[dependencies]
fuzzy-matcher = "*"

Here are some code example:

use fuzzy_matcher::FuzzyMatcher;
use fuzzy_matcher::skim::SkimMatcherV2;

let matcher = SkimMatcherV2::default();
assert_eq!(None, matcher.fuzzy_match("abc", "abx"));
assert!(matcher.fuzzy_match("axbycz", "abc").is_some());
assert!(matcher.fuzzy_match("axbycz", "xyz").is_some());

let (score, indices) = matcher.fuzzy_indices("axbycz", "abc").unwrap();
assert_eq!(indices, [0, 2, 4]);
  • fuzzy_match only return scores while fuzzy_indices returns the matching indices as well.
  • Both function return None if the pattern won't match.
  • The score is the higher the better.

More example

echo "axbycz" | cargo run --example fz "abc" and check what happens.

About the Algorithm

Skim

The skim is currently used by skim, a fuzzy finder.

Skim V2

  • Just like fzf v2, the algorithm is based on Smith-Waterman algorithm which is normally used in DNA sequence alignment
  • Also checkout https://www.cs.cmu.edu/~ckingsf/bioinfo-lectures/gaps.pdf for more details
  • The time complexity is O(mn) where m, n are the length of the pattern and input line.
  • Space complexity is O(mn) for fuzzy_indices and O(2n) for fuzzy_match which will compress the table for dynamic programming.
  • V2 matcher has an option to set the max element of the score matrix, if m*n exceeded the limit, it will fallback to a linear search.

Skim V1

Clangd

  • The algorithm is based on clangd's FuzzyMatch.cpp.
  • Also checkout https://github.com/lewang/flx/issues/98 for some variants.
  • The algorithm is O(mn) where m, n are the length of the pattern and input line.
  • Space complexity is O(mn) for fuzzy_indices and O(2n) for fuzzy_match which will compress the table for dynamic programming.

Dependencies

~88KB