/**
 * Levenshtein distance + "did you mean?" suggestions.
 *
 * Used to surface typo corrections for grader names and config keys.
 * Pure computation — no I/O.
 */
/**
 * Classic Levenshtein with early-exit when distance exceeds `max`.
 * O(min(m,n) * max) time, O(min(m,n)) space.
 */
export declare function levenshtein(a: string, b: string, max?: number): number;
/**
 * Return the best match from `candidates` if it's close enough to `input`.
 * "Close enough" = distance ≤ 2 or ≤ 30 % of the input length, whichever is larger.
 */
export declare function suggest(input: string, candidates: string[]): string | undefined;
//# sourceMappingURL=fuzzy.d.ts.map