/**
 * Trie node for efficient pattern matching
 */
declare class TrieNode {
    children: Map<string, TrieNode>;
    isEndOfWord: boolean;
    severity: number;
    category: string;
    originalWord: string;
    constructor();
}
/**
 * Aho-Corasick Trie for efficient multi-pattern matching
 * Time complexity: O(n + m + z) where n=text length, m=total pattern length, z=matches
 */
export declare class AhoCorasickTrie {
    private root;
    private failureLinks;
    constructor();
    /**
     * Insert a word into the trie
     */
    insert(word: string, severity: number, category?: string): void;
    /**
     * Build failure links for Aho-Corasick algorithm
     */
    buildFailureLinks(): void;
    /**
     * Search for all patterns in the text
     */
    search(text: string, partialMatch?: boolean): Array<{
        word: string;
        severity: number;
        category: string;
        position: number;
        length: number;
    }>;
    /**
     * Check if position is at a word boundary
     */
    private isWordBoundary;
    /**
     * Check if character is a word character
     */
    private isWordChar;
    /**
     * Get the root node (for testing)
     */
    getRoot(): TrieNode;
}
export {};
//# sourceMappingURL=trie.d.ts.map