Function bk_tree::metrics::levenshtein

pub fn levenshtein(a: &str, b: &str) -> u64

This calculates the Levenshtein distance between two strings.

The distance metric itself is calculated using the Wagner-Fischer dynamic programming algorithm.

Examples

use bk_tree::metrics::levenshtein;

assert_eq!(levenshtein("bar", "baz"), 1);
assert_eq!(levenshtein("kitten", "sitting"), 3);