Crates.io | sift4 |
lib.rs | sift4 |
version | 0.1.4 |
source | src |
created_at | 2019-01-18 01:28:05.816329 |
updated_at | 2019-02-16 20:31:11.137315 |
description | This crate provides the sift4 string distance algorithm. It is very fast and returns results similar to levenshtein |
homepage | |
repository | https://github.com/PrismaPhonic/sift4-rs |
max_upload_size | |
id | 109252 |
size | 5,143 |
This is a rust implementation of the sift4 string distance algorithm. Sift4 is very fast and unlike sift3 more closely resembles what you would get from the Levenshtein distance algorithm.
sift4 is available on crates.io.
[dependencies]
sift4 = "0.1.4"
For now there is only the simple algorithm, which uses a max offset of 5:
extern crate sift4;
let distance = sift4::simple("London", "Londo");
assert_eq!(1, distance);