/**
 * Calculates the similarity between two strings using the Levenshtein distance algorithm.
 *
 * @param a - The first string to compare
 * @param b - The second string to compare
 * @returns A similarity score between 0 and 1, where 1 means the strings are identical and 0 means completely different
 *
 * @example
 * similarity("hello", "hello") // returns 1 (identical)
 * similarity("hello", "hallo") // returns 0.8 (one character different)
 * similarity("abc", "def") // returns 0 (completely different)
 * similarity("", "") // returns 0 (one or both strings empty)
 *
 * @note Uses dynamic programming to compute the Levenshtein distance (edit distance) and converts it to a similarity score.
 *       The algorithm accounts for three operations: insertion, deletion, and substitution.
 */
export declare function similarity(a: string, b: string): number;
//# sourceMappingURL=similarity.d.ts.map