devela::_dep::stringzilla::sz

Function edit_distance_bounded

pub fn edit_distance_bounded<F, S>(first: F, second: S, bound: usize) -> usize ⓘ
where
    F: AsRef<[u8]>,
    S: AsRef<[u8]>,
Available on crate feature dep_stringzilla only.
Expand description

Computes the Levenshtein edit distance between two strings, using the Wagner-Fisher algorithm. This measure is widely used in applications like spell-checking, DNA sequence analysis.

§Arguments

  • first: The first byte slice.
  • second: The second byte slice.
  • bound: The maximum distance to compute, allowing for early exit.

§Returns

A usize representing the minimum number of single-character edits (insertions, deletions, or substitutions) required to change first into second.