/**
 * Computes the Levenshtein distance between two strings using the
 * Wagner-Fischer algorithm with single-row space optimization.
 * @param a - First string
 * @param b - Second string
 * @returns The edit distance between the two strings
 */
export declare function levenshteinDistance(a: string, b: string): number;
/**
 * Computes a normalized similarity score between 0 and 1.
 * 1 means identical, 0 means completely different.
 * @param a - First string
 * @param b - Second string
 * @returns Similarity score between 0 and 1
 */
export declare function levenshteinSimilarity(a: string, b: string): number;