strsim-rs
strsim-rs copied to clipboard
rapidfuzz
:abc: Rust implementations of string similarity metrics
This solution uses the length finding variant of LCS algorithm. Time Complexity: O(n * m) Memory Complexity: O(min(n, m)) The solution itself is based on a lightweight library that I've...
When comparing two strings that have a lot of transposed characters, the score comes out slightly wrong. For example: the strings "a jke" and "jane a k" produce a result...
I see in the changelog file that this crate attempts to follow semver. AFAIK, 0.10.0 was released with no breaking changes, only a new feature. Filing this only in case...
When a_elem == b_elem, alway from the diagonal value. Moreover, this repo needs `cargo fmt` for the convenience of further pull requests.
The original functions could not take references to slices and were somewhat limiting in their input. This change makes them more generic by allowing more types to be passed into...
I am having a hard time understanding what all those functions of this library are used for and which one I should use. It would be good to have a...
In the implementation of the jaro distance, there is a useless loop on all the characters of both strings : https://github.com/dguo/strsim-rs/blob/master/src/lib.rs#L62-L63 `string.chars().count()` runs in `O(n)` on the length of `string`
I've gotten good results in the past by using the string similarity defined in the [Postgres pg_trgm extension](https://www.postgresql.org/docs/9.1/pgtrgm.html). I have an implementation for it in Rust and was thinking of...
Uses proptest to generate many arbitrary strings to compare for each of the similarity functions.
