/**
 * Computes the Levenshtein edit distance between two strings.
 *
 * The edit distance is the minimum number of single-character insertions,
 * deletions, or substitutions required to turn `a` into `b`.
 *
 * Uses a two-row dynamic programming approach, so memory usage is O(min(a, b))
 * rather than O(a * b).
 *
 * @param a - The first string
 * @param b - The second string
 * @returns The Levenshtein distance between the two strings
 */
export declare function levenshtein(a: string, b: string): number;
//# sourceMappingURL=levenshtein.d.ts.map