| Crates.io | leven-distance |
| lib.rs | leven-distance |
| version | 1.0.0 |
| created_at | 2024-02-06 18:03:27.158327+00 |
| updated_at | 2024-02-06 18:03:27.158327+00 |
| description | Compute operational differences between two sequences using the Levenshtein algorithm. |
| homepage | |
| repository | https://github.com/syn-chromatic/levenshtein-rs |
| max_upload_size | |
| id | 1129258 |
| size | 15,610 |
⌽ LevenshteinCompute operational differences between two sequences using the Levenshtein algorithm.
Cargo.tomlleven-distance = "*"
➢ Usage:⤷ Basic Usageuse levenshtein::Levenshtein;
use levenshtein::Results;
fn main() {
let mut levenshtein: Levenshtein = Levenshtein::new();
// Specify costs as you see fit, the default is 1 for all parameters.
levenshtein.set_insert_cost(2);
levenshtein.set_replace_cost(2);
levenshtein.set_delete_cost(2);
let results: Results = levenshtein.calculate("test", "text");
let distance: i32 = results.distance();
let sequence: &Vec<Vec<i32>> = results.sequence();
println!("Distance: {}", distance);
println!("Sequence: {:#?}", sequence);
}
➢ LicenseThis project is licensed under the MIT License.
See the LICENSE file for more information.