levenshtein
Returns the minimum number of insertions, deletions, and substitutions needed to transform one string into another. Distance is measured over UTF-8 bytes.
tyrus
import { levenshtein } from "tyrus:algorithm";
const distance: usize = levenshtein("kitten", "sitting");
print(distance); // 3Study result
tyrus
interface EditDistanceInfo {
left: string;
right: string;
distance: usize;
rowCount: usize;
columnCount: usize;
evaluatedCellCount: usize;
}tyrus
import { EditDistanceInfo, levenshteinInfo } from "tyrus:algorithm";
const info: EditDistanceInfo = levenshteinInfo("kitten", "sitting");
print(info.left); // kitten
print(info.right); // sitting
print(info.distance); // 3
print(info.rowCount); // 7
print(info.columnCount); // 8
print(info.evaluatedCellCount); // 42The study result retains the rolling row used by the calculation and reports its dimensions and evaluated cells without returning a quadratic matrix.
The algorithm runs in O(nm) time and O(m) auxiliary space.
