@orama/orama/dist/browser/components/levenshtein.d.ts

A complete search engine and RAG pipeline in your browser, server, or edge network with support for full-text, vector, and hybrid search in less than 2kb.

export type BoundedMetric = {
    isBounded: boolean;
    distance: number;
};
/**
 * Computes the Levenshtein distance between two strings (a, b), returning early with -1 if the distance
 * is greater than the given tolerance.
 * It assumes that:
 * - tolerance >= ||a| - |b|| >= 0
 */
export declare function boundedLevenshtein(term: string, w: string, tolerance: number): BoundedMetric;
export declare function syncBoundedLevenshtein(term: string, w: string, tolerance: number): BoundedMetric;
export declare function levenshtein(a: string, b: string): number;