Struct Levenshtein

pub struct Levenshtein { /* private fields */ }

A struct for calculating Levenshtein distance.

This struct provides methods to set custom costs for insert, delete, and replace operations and a method to calculate the Levenshtein distance between two sequences.

Implementations

impl Levenshtein

pub fn new() -> Levenshtein

Constructs a new Levenshtein.

Initializes with default costs for insertion, deletion, and replacement operations.

Examples

let levenshtein = Levenshtein::new();

pub fn set_insert_cost(&mut self, cost: i32)

Sets the cost of an insertion operation.

Arguments

• cost - The cost of an insertion operation.

Examples

let mut levenshtein = Levenshtein::new();
levenshtein.set_insert_cost(2);

pub fn set_replace_cost(&mut self, cost: i32)

Sets the cost of a replacement operation.

Arguments

• cost - The cost of a replacement operation.

Examples

let mut levenshtein = Levenshtein::new();
levenshtein.set_replace_cost(1);

pub fn set_delete_cost(&mut self, cost: i32)

Sets the cost of a deletion operation.

Arguments

• cost - The cost of a deletion operation.

Examples

let mut levenshtein = Levenshtein::new();
levenshtein.set_delete_cost(2);

pub fn calculate(&self, seq1: &str, seq2: &str) -> Results

Calculates the Levenshtein distance between two sequences.

Returns a Results struct containing the distance and the sequence of operations.

Arguments

• seq1 - The first sequence.
• seq2 - The second sequence.

Examples

let levenshtein = Levenshtein::new();
let results = levenshtein.calculate("kitten", "sitting");