/**
 * Suggestion utilities for "did you mean?" functionality.
 * Provides fuzzy matching to help users correct typos in task IDs, plan names, etc.
 */
/**
 * Calculate Levenshtein (edit) distance between two strings.
 * This measures the minimum number of single-character edits (insertions, deletions, substitutions)
 * required to change one string into the other.
 *
 * @param a - First string
 * @param b - Second string
 * @returns Edit distance (0 = identical)
 */
export declare function levenshteinDistance(a: string, b: string): number;
/**
 * Options for findSimilar function.
 */
export interface FindSimilarOptions {
    /** Maximum edit distance to consider (default: 3) */
    maxDistance?: number;
    /** Maximum number of results to return (default: 5) */
    limit?: number;
}
/**
 * Find similar strings to the input from a list of candidates.
 * Uses Levenshtein distance to find close matches, sorted by similarity.
 *
 * @param input - The string to find matches for
 * @param candidates - List of possible matches
 * @param options - Configuration options
 * @returns Array of similar strings, sorted by distance (closest first)
 *
 * @example
 * findSimilar('statsu', ['status', 'start', 'stats', 'stop'])
 * // Returns: ['status', 'stats', 'start']
 */
export declare function findSimilar(input: string, candidates: string[], options?: FindSimilarOptions): string[];
//# sourceMappingURL=suggestions.d.ts.map