/**
 * Author: Charuka Rathnayaka
 * Email: CharukaR@99x.io
**/
export declare class LevenshteinDataInjector {
    /**
     * injectData
     * @param data - The data object to be injected.
     * @param schema - The schema object to be injected into.
     * @returns { remainingDataLevenshtein: { [key: string]: any }, injectedSchemaLevenshtein: { [key: string]: any } }
     *
     * This function injects data into a schema object based on the similarity between the keys of the data and schema.
     */
    injectData(data: {
        [key: string]: any;
    }, schema: {
        [key: string]: any;
    }): {
        remainingDataLevenshtein: {
            [key: string]: any;
        };
        injectedSchemaLevenshtein: {
            [key: string]: any;
        };
    };
    computeSimilarity(stringA: string, stringB: string): number;
    /**
     * levenshtein
     * @param stringA - The first string for comparison.
     * @param stringB - The second string for comparison.
     * @returns number
     *
     * This function computes the Levenshtein distance between two strings. The Levenshtein distance
     * is a metric for measuring the difference between two sequences by counting the minimum number
     * of operations required to transform one string into the other.
     */
    levenshtein(stringA: string, stringB: string): number;
}