memento-mcp-server 1.13.1-a2 → 1.13.1-a4

package/dist/services/lightweight-embedding-service.d.ts

@@ -1,95 +0,0 @@
-/**
- * 경량 하이브리드 임베딩 서비스
- * TF-IDF + 키워드 매칭 기반 벡터화
- * OpenAI가 없을 때 사용하는 fallback 솔루션
- */
-import type { EmbeddingProvider } from '../types/embedding.types.js';
-export interface LightweightEmbeddingResult {
-    embedding: number[];
-    model: string;
-    provider?: EmbeddingProvider;
-    usage: {
-        prompt_tokens: number;
-        total_tokens: number;
-    };
-}
-export interface LightweightSimilarityResult {
-    id: string;
-    content: string;
-    similarity: number;
-    score: number;
-}
-export declare class LightweightEmbeddingService {
-    private readonly model;
-    private readonly dimensions;
-    private vocabulary;
-    private documentFrequencies;
-    private totalDocuments;
-    private readonly stopWords;
-    constructor();
-    /**
-     * 텍스트를 경량 임베딩으로 변환
-     */
-    generateEmbedding(text: string): Promise<LightweightEmbeddingResult | null>;
-    /**
-     * 쿼리와 유사한 임베딩 검색
-     */
-    searchSimilar(query: string, embeddings: Array<{
-        id: string;
-        content: string;
-        embedding: number[];
-    }>, limit?: number, threshold?: number): Promise<LightweightSimilarityResult[]>;
-    /**
-     * 텍스트 전처리
-     */
-    private preprocessText;
-    /**
-     * TF-IDF 벡터 생성
-     */
-    private createTFIDFVector;
-    /**
-     * IDF 계산 (간단한 휴리스틱)
-     */
-    private calculateIDF;
-    /**
-     * 키워드 가중치 적용
-     */
-    private applyKeywordWeights;
-    /**
-     * 기술 용어 판별
-     */
-    private isTechnicalTerm;
-    /**
-     * 벡터 정규화
-     */
-    private normalizeVector;
-    /**
-     * 차원 조정
-     */
-    private adjustDimensions;
-    /**
-     * 해시 기반 인덱스 생성
-     */
-    private hashToIndex;
-    /**
-     * 코사인 유사도 계산
-     */
-    private cosineSimilarity;
-    /**
-     * 토큰 수 추정
-     */
-    private estimateTokens;
-    /**
-     * 서비스 사용 가능 여부 확인
-     */
-    isAvailable(): boolean;
-    /**
-     * 모델 정보 반환
-     */
-    getModelInfo(): {
-        model: string;
-        dimensions: number;
-        maxTokens: number;
-    };
-}
-//# sourceMappingURL=lightweight-embedding-service.d.ts.map

package/dist/services/lightweight-embedding-service.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"lightweight-embedding-service.d.ts","sourceRoot":"","sources":["../../src/services/lightweight-embedding-service.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAErE,MAAM,WAAW,0BAA0B;IACzC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,iBAAiB,CAAC;IAC7B,KAAK,EAAE;QACL,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;KACtB,CAAC;CACH;AAED,MAAM,WAAW,2BAA2B;IAC1C,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,2BAA2B;IACtC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwB;IAC9C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAO;IAClC,OAAO,CAAC,UAAU,CAAkC;IACpD,OAAO,CAAC,mBAAmB,CAAkC;IAC7D,OAAO,CAAC,cAAc,CAAK;IAC3B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAc;;IAQxC;;OAEG;IACG,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,0BAA0B,GAAG,IAAI,CAAC;IAoCjF;;OAEG;IACG,aAAa,CACjB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,EACvE,KAAK,GAAE,MAAW,EAClB,SAAS,GAAE,MAAY,GACtB,OAAO,CAAC,2BAA2B,EAAE,CAAC;IAyBzC;;OAEG;IACH,OAAO,CAAC,cAAc;IAStB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAuBzB;;OAEG;IACH,OAAO,CAAC,YAAY;IAsBpB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAoC3B;;OAEG;IACH,OAAO,CAAC,eAAe;IAavB;;OAEG;IACH,OAAO,CAAC,eAAe;IAOvB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAYxB;;OAEG;IACH,OAAO,CAAC,WAAW;IAUnB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IA2BxB;;OAEG;IACH,OAAO,CAAC,cAAc;IAKtB;;OAEG;IACH,WAAW,IAAI,OAAO;IAItB;;OAEG;IACH,YAAY,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;CAOzE"}

package/dist/services/lightweight-embedding-service.js

@@ -1,264 +0,0 @@
-/**
- * 경량 하이브리드 임베딩 서비스
- * TF-IDF + 키워드 매칭 기반 벡터화
- * OpenAI가 없을 때 사용하는 fallback 솔루션
- */
-import { getStopWords } from '../utils/stopwords.js';
-export class LightweightEmbeddingService {
-    model = 'lightweight-hybrid';
-    dimensions = 512; // 고정 차원
-    vocabulary = new Map();
-    documentFrequencies = new Map();
-    totalDocuments = 0;
-    stopWords;
-    constructor() {
-        this.stopWords = getStopWords();
-        // stderr로 로그 출력 (MCP 프로토콜 준수)
-        process.stderr.write('✅ 경량 하이브리드 임베딩 서비스 초기화 완료\n');
-    }
-    /**
-     * 텍스트를 경량 임베딩으로 변환
-     */
-    async generateEmbedding(text) {
-        if (!text || text.trim().length === 0) {
-            throw new Error('텍스트가 비어있습니다');
-        }
-        try {
-            // 1. 텍스트 전처리
-            const processedText = this.preprocessText(text);
-            // 2. TF-IDF 벡터 생성
-            const tfidfVector = this.createTFIDFVector(processedText);
-            // 3. 키워드 가중치 적용
-            const weightedVector = this.applyKeywordWeights(tfidfVector, processedText);
-            // 4. 벡터 정규화
-            const normalizedVector = this.normalizeVector(weightedVector);
-            // 5. 차원 맞추기 (패딩 또는 자르기)
-            const finalVector = this.adjustDimensions(normalizedVector);
-            return {
-                embedding: finalVector,
-                model: this.model,
-                provider: 'tfidf',
-                usage: {
-                    prompt_tokens: this.estimateTokens(text),
-                    total_tokens: this.estimateTokens(text),
-                },
-            };
-        }
-        catch (error) {
-            console.error('❌ 경량 임베딩 생성 실패:', error);
-            throw new Error(`경량 임베딩 생성 실패: ${error instanceof Error ? error.message : 'Unknown error'}`);
-        }
-    }
-    /**
-     * 쿼리와 유사한 임베딩 검색
-     */
-    async searchSimilar(query, embeddings, limit = 10, threshold = 0.7) {
-        // 쿼리 임베딩 생성
-        const queryEmbedding = await this.generateEmbedding(query);
-        if (!queryEmbedding) {
-            return [];
-        }
-        // 코사인 유사도 계산
-        const similarities = embeddings.map(item => {
-            const similarity = this.cosineSimilarity(queryEmbedding.embedding, item.embedding);
-            return {
-                id: item.id,
-                content: item.content,
-                similarity,
-                score: similarity
-            };
-        });
-        // 유사도 순으로 정렬하고 임계값 필터링
-        return similarities
-            .filter(item => item.similarity >= threshold)
-            .sort((a, b) => b.similarity - a.similarity)
-            .slice(0, limit);
-    }
-    /**
-     * 텍스트 전처리
-     */
-    preprocessText(text) {
-        return text
-            .toLowerCase()
-            .replace(/[^\w\s가-힣]/g, ' ') // 특수문자 제거, 한글 유지
-            .split(/\s+/)
-            .filter(word => word.length > 1 && !this.stopWords.has(word))
-            .filter(word => word.trim().length > 0);
-    }
-    /**
-     * TF-IDF 벡터 생성
-     */
-    createTFIDFVector(words) {
-        const vector = new Array(this.dimensions).fill(0);
-        const wordCounts = new Map();
-        // 단어 빈도 계산
-        for (const word of words) {
-            wordCounts.set(word, (wordCounts.get(word) || 0) + 1);
-        }
-        // TF-IDF 계산
-        for (const [word, count] of wordCounts) {
-            const tf = count / words.length; // Term Frequency
-            const idf = this.calculateIDF(word); // Inverse Document Frequency
-            const tfidf = tf * idf;
-            // 해시 기반 인덱스 생성
-            const index = this.hashToIndex(word);
-            vector[index] += tfidf;
-        }
-        return vector;
-    }
-    /**
-     * IDF 계산 (간단한 휴리스틱)
-     */
-    calculateIDF(word) {
-        // 실제로는 문서 컬렉션에서 계산해야 하지만, 
-        // 여기서는 단어 길이와 복잡성을 기반으로 휴리스틱 사용
-        const wordLength = word.length;
-        const hasNumbers = /\d/.test(word);
-        const hasSpecialChars = /[^a-zA-Z가-힣]/.test(word);
-        let idf = 1.0;
-        // 긴 단어일수록 높은 IDF
-        if (wordLength > 5)
-            idf += 0.5;
-        if (wordLength > 8)
-            idf += 0.3;
-        // 숫자가 포함된 단어는 낮은 IDF (일반적으로 덜 중요)
-        if (hasNumbers)
-            idf -= 0.2;
-        // 특수문자가 포함된 단어는 높은 IDF (고유할 가능성)
-        if (hasSpecialChars)
-            idf += 0.3;
-        return Math.max(0.1, idf);
-    }
-    /**
-     * 키워드 가중치 적용
-     */
-    applyKeywordWeights(vector, words) {
-        const weightedVector = [...vector];
-        // 중요한 키워드 패턴에 가중치 적용
-        for (const word of words) {
-            if (!word || word.trim().length === 0)
-                continue; // undefined 및 빈 문자열 체크
-            const index = this.hashToIndex(word);
-            // 배열 범위 체크
-            if (index < 0 || index >= weightedVector.length)
-                continue;
-            // 안전한 배열 접근을 위한 체크
-            const currentValue = weightedVector[index];
-            if (currentValue === undefined)
-                continue;
-            // 기술 용어 가중치
-            if (this.isTechnicalTerm(word)) {
-                weightedVector[index] = currentValue * 1.5;
-            }
-            // 고유명사 가중치 (대문자로 시작하는 단어)
-            if (word.length > 2 && word[0] && word[0] === word[0].toUpperCase()) {
-                weightedVector[index] = currentValue * 1.3;
-            }
-            // 반복되는 단어 가중치 감소
-            const wordFrequency = words.filter(w => w === word).length;
-            if (wordFrequency > 3) {
-                weightedVector[index] = currentValue * 0.8;
-            }
-        }
-        return weightedVector;
-    }
-    /**
-     * 기술 용어 판별
-     */
-    isTechnicalTerm(word) {
-        const technicalPatterns = [
-            /^[a-z]+[A-Z]/, // camelCase
-            /^[A-Z][a-z]+[A-Z]/, // PascalCase
-            /^[a-z]+_[a-z]+/, // snake_case
-            /^[a-z]+-[a-z]+/, // kebab-case
-            /api|sdk|http|json|xml|sql|db|ui|ux|ai|ml|nlp/i, // 기술 용어
-            /react|vue|angular|node|python|java|typescript/i, // 프레임워크/언어
-        ];
-        return technicalPatterns.some(pattern => pattern.test(word));
-    }
-    /**
-     * 벡터 정규화
-     */
-    normalizeVector(vector) {
-        const magnitude = Math.sqrt(vector.reduce((sum, val) => sum + val * val, 0));
-        if (magnitude === 0)
-            return vector;
-        return vector.map(val => val / magnitude);
-    }
-    /**
-     * 차원 조정
-     */
-    adjustDimensions(vector) {
-        if (vector.length === this.dimensions) {
-            return vector;
-        }
-        else if (vector.length < this.dimensions) {
-            // 패딩
-            return [...vector, ...new Array(this.dimensions - vector.length).fill(0)];
-        }
-        else {
-            // 자르기
-            return vector.slice(0, this.dimensions);
-        }
-    }
-    /**
-     * 해시 기반 인덱스 생성
-     */
-    hashToIndex(word) {
-        let hash = 0;
-        for (let i = 0; i < word.length; i++) {
-            const char = word.charCodeAt(i);
-            hash = ((hash << 5) - hash) + char;
-            hash = hash & hash; // 32비트 정수로 변환
-        }
-        return Math.abs(hash) % this.dimensions;
-    }
-    /**
-     * 코사인 유사도 계산
-     */
-    cosineSimilarity(a, b) {
-        if (a.length !== b.length) {
-            throw new Error('벡터 차원이 일치하지 않습니다');
-        }
-        let dotProduct = 0;
-        let normA = 0;
-        let normB = 0;
-        for (let i = 0; i < a.length; i++) {
-            const aVal = a[i] || 0;
-            const bVal = b[i] || 0;
-            dotProduct += aVal * bVal;
-            normA += aVal * aVal;
-            normB += bVal * bVal;
-        }
-        normA = Math.sqrt(normA);
-        normB = Math.sqrt(normB);
-        if (normA === 0 || normB === 0) {
-            return 0;
-        }
-        return dotProduct / (normA * normB);
-    }
-    /**
-     * 토큰 수 추정
-     */
-    estimateTokens(text) {
-        // 간단한 추정: 1 토큰 ≈ 4 문자
-        return Math.ceil(text.length / 4);
-    }
-    /**
-     * 서비스 사용 가능 여부 확인
-     */
-    isAvailable() {
-        return true; // 항상 사용 가능
-    }
-    /**
-     * 모델 정보 반환
-     */
-    getModelInfo() {
-        return {
-            model: this.model,
-            dimensions: this.dimensions,
-            maxTokens: 8191, // OpenAI와 동일한 제한
-        };
-    }
-}
-//# sourceMappingURL=lightweight-embedding-service.js.map

package/dist/services/lightweight-embedding-service.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lightweight-embedding-service.js","sourceRoot":"","sources":["../../src/services/lightweight-embedding-service.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAqBrD,MAAM,OAAO,2BAA2B;IACrB,KAAK,GAAG,oBAAoB,CAAC;IAC7B,UAAU,GAAG,GAAG,CAAC,CAAC,QAAQ;IACnC,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC5C,mBAAmB,GAAwB,IAAI,GAAG,EAAE,CAAC;IACrD,cAAc,GAAG,CAAC,CAAC;IACV,SAAS,CAAc;IAExC;QACE,IAAI,CAAC,SAAS,GAAG,YAAY,EAAE,CAAC;QAChC,8BAA8B;QAC9B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,iBAAiB,CAAC,IAAY;QAClC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,CAAC;YACH,aAAa;YACb,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;YAEhD,kBAAkB;YAClB,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;YAE1D,gBAAgB;YAChB,MAAM,cAAc,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;YAE5E,YAAY;YACZ,MAAM,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;YAE9D,wBAAwB;YACxB,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;YAE5D,OAAO;gBACL,SAAS,EAAE,WAAW;gBACtB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,QAAQ,EAAE,OAA4B;gBACtC,KAAK,EAAE;oBACL,aAAa,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;oBACxC,YAAY,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;iBACxC;aACF,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,iBAAiB,EAAE,KAAK,CAAC,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,iBAAiB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,KAAa,EACb,UAAuE,EACvE,QAAgB,EAAE,EAClB,YAAoB,GAAG;QAEvB,YAAY;QACZ,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC3D,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,aAAa;QACb,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACzC,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,cAAc,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACnF,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,UAAU;gBACV,KAAK,EAAE,UAAU;aAClB,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,uBAAuB;QACvB,OAAO,YAAY;aAChB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC;aAC5C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAAY;QACjC,OAAO,IAAI;aACR,WAAW,EAAE;aACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,iBAAiB;aAC7C,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;aAC5D,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAe;QACvC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE7C,WAAW;QACX,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,YAAY;QACZ,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;YACvC,MAAM,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,iBAAiB;YAClD,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,6BAA6B;YAClE,MAAM,KAAK,GAAG,EAAE,GAAG,GAAG,CAAC;YAEvB,eAAe;YACf,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QACzB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAY;QAC/B,2BAA2B;QAC3B,gCAAgC;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;QAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,eAAe,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAElD,IAAI,GAAG,GAAG,GAAG,CAAC;QAEd,iBAAiB;QACjB,IAAI,UAAU,GAAG,CAAC;YAAE,GAAG,IAAI,GAAG,CAAC;QAC/B,IAAI,UAAU,GAAG,CAAC;YAAE,GAAG,IAAI,GAAG,CAAC;QAE/B,kCAAkC;QAClC,IAAI,UAAU;YAAE,GAAG,IAAI,GAAG,CAAC;QAE3B,iCAAiC;QACjC,IAAI,eAAe;YAAE,GAAG,IAAI,GAAG,CAAC;QAEhC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,MAAgB,EAAE,KAAe;QAC3D,MAAM,cAAc,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAEnC,qBAAqB;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS,CAAC,uBAAuB;YAExE,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAErC,WAAW;YACX,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,cAAc,CAAC,MAAM;gBAAE,SAAS;YAE1D,mBAAmB;YACnB,MAAM,YAAY,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;YAC3C,IAAI,YAAY,KAAK,SAAS;gBAAE,SAAS;YAEzC,YAAY;YACZ,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,cAAc,CAAC,KAAK,CAAC,GAAG,YAAY,GAAG,GAAG,CAAC;YAC7C,CAAC;YAED,0BAA0B;YAC1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;gBACpE,cAAc,CAAC,KAAK,CAAC,GAAG,YAAY,GAAG,GAAG,CAAC;YAC7C,CAAC;YAED,iBAAiB;YACjB,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC;YAC3D,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;gBACtB,cAAc,CAAC,KAAK,CAAC,GAAG,YAAY,GAAG,GAAG,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAY;QAClC,MAAM,iBAAiB,GAAG;YACxB,cAAc,EAAE,YAAY;YAC5B,mBAAmB,EAAE,aAAa;YAClC,gBAAgB,EAAE,aAAa;YAC/B,gBAAgB,EAAE,aAAa;YAC/B,+CAA+C,EAAE,QAAQ;YACzD,gDAAgD,EAAE,WAAW;SAC9D,CAAC;QAEF,OAAO,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,MAAgB;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,SAAS,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAEnC,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAAgB;QACvC,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YACtC,OAAO,MAAM,CAAC;QAChB,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,KAAK;YACL,OAAO,CAAC,GAAG,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,CAAC;aAAM,CAAC;YACN,MAAM;YACN,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAY;QAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YACnC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,cAAc;QACpC,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC/C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,UAAU,IAAI,IAAI,GAAG,IAAI,CAAC;YAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;YACrB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;QACvB,CAAC;QAED,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEzB,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,CAAC,CAAC;QACX,CAAC;QAED,OAAO,UAAU,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAAY;QACjC,sBAAsB;QACtB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,CAAC,WAAW;IAC1B,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,SAAS,EAAE,IAAI,EAAE,iBAAiB;SACnC,CAAC;IACJ,CAAC;CACF"}

package/dist/services/llm-based-relation-extractor.d.ts

@@ -1,156 +0,0 @@
-/**
- * LLM 기반 관계 추출기
- * LLM을 사용하여 기억 간의 관계를 추출합니다.
- * 규칙 기반이 실패하거나 신뢰도가 낮은 경우 사용됩니다.
- *
- * 비용 최적화 전략:
- * - Embedding 기반 후보 제한 (cosine similarity 상위 N개)
- * - Rate limit (토큰 버킷 알고리즘, 초당 1회)
- * - 프롬프트 압축 (최대 500 토큰)
- * - 캐싱 (7일 TTL)
- * - 배치 처리 (최대 10개)
- * - 비용 모니터링
- */
-import type { RelationCandidate, RelationType, IRelationExtractor, ExtractOptions } from '../types/relation.js';
-import type { MemoryItem } from '../types/index.js';
-/**
- * LLM 응답 파싱 결과
- * 외부에서 접근 가능하도록 클래스 외부에 정의
- */
-export interface ParseResult {
-    success: boolean;
-    relations: Array<{
-        target_id: string;
-        relation_type: RelationType;
-        confidence: number;
-        reasoning?: string;
-    }>;
-    error?: string;
-}
-/**
- * LLM 비용 모니터링
- */
-interface LLMCostMetrics {
-    totalCalls: number;
-    totalTokens: number;
-    totalCost: number;
-    lastReset: number;
-}
-/**
- * LLM 기반 관계 추출기
- */
-export declare class LLMBasedRelationExtractor implements IRelationExtractor {
-    private openaiClient;
-    private geminiClient;
-    private readonly preferredProvider;
-    private readonly embeddingService;
-    private readonly cache;
-    private readonly rateLimiter;
-    private readonly costMetrics;
-    constructor();
-    /**
-     * LLM 클라이언트 초기화
-     * 환경 변수 LLM_PROVIDER에 따라 프로바이더 선택
-     * - 'openai': OpenAI 우선 시도, 실패 시 Gemini/Ollama fallback
-     * - 'gemini': Gemini 우선 시도, 실패 시 OpenAI/Ollama fallback
-     * - 'ollama': Ollama 우선 시도, 실패 시 OpenAI/Gemini fallback
-     * - 'auto': 사용 가능한 것 자동 선택 (OpenAI -> Gemini -> Ollama 순서)
-     */
-    private initializeClients;
-    /**
-     * LLM 서비스 사용 가능 여부 확인
-     */
-    isAvailable(): boolean;
-    /**
-     * 관계 추출 프롬프트 템플릿 생성
-     */
-    private buildPrompt;
-    /**
-     * Embedding 기반 후보 필터링
-     * cosine similarity 상위 N개만 LLM 비교 대상으로 선정
-     */
-    private filterCandidatesByEmbedding;
-    /**
-     * 기존 기억 목록을 요약하여 프롬프트 크기 축소
-     * 간단한 요약: 내용을 최대 길이로 제한
-     */
-    private compressMemories;
-    /**
-     * 캐시 키 생성
-     * 공통 유틸리티를 사용하여 일관된 캐시 키를 생성합니다.
-     */
-    private generateCacheKey;
-    /**
-     * 비용 계산 및 모니터링
-     * 비용 계산과 모니터링 로그를 통합하여 중복을 제거합니다.
-     *
-     * @param provider LLM 제공자
-     * @param promptTokens 프롬프트 토큰 수
-     * @param completionTokens 완료 토큰 수
-     * @returns 계산된 비용 (USD)
-     */
-    private calculateAndLogCost;
-    /**
-     * OpenAI를 사용하여 관계 추출
-     */
-    private extractWithOpenAI;
-    /**
-     * Ollama 모델 존재 여부 확인
-     */
-    private checkOllamaModel;
-    /**
-     * Ollama를 사용하여 관계 추출
-     */
-    private extractWithOllama;
-    /**
-     * Gemini를 사용하여 관계 추출
-     */
-    private extractWithGemini;
-    /**
-     * LLM 응답에서 JSON 객체 추출
-     * JSON 뒤에 추가 텍스트가 있어도 첫 번째 유효한 JSON만 추출
-     *
-     * Given: LLM 응답 텍스트 (JSON 형식이어야 하지만 추가 텍스트가 포함될 수 있음)
-     * When: JSON 객체 추출 시도
-     * Then: 유효한 JSON 객체만 반환 (추가 텍스트 제거)
-     */
-    private extractJSON;
-    /**
-     * LLM 응답을 파싱하여 관계 후보 추출
-     *
-     * @param responseText LLM 응답 텍스트
-     * @returns 파싱 결과 (성공 여부와 관계 목록 포함)
-     * @throws 파싱 실패 시 예외를 던지지 않고 ParseResult에 실패 정보를 포함하여 반환
-     */
-    private parseLLMResponse;
-    /**
-     * 새로운 기억과 기존 기억들 간의 관계를 추출합니다.
-     *
-     * @param newMemory 새로운 기억
-     * @param existingMemories 기존 기억 목록
-     * @param options 추출 옵션
-     * @returns 관계 후보 목록
-     */
-    extractRelations(newMemory: MemoryItem, existingMemories: MemoryItem[], options?: ExtractOptions): Promise<RelationCandidate[]>;
-    /**
-     * 배치 관계 추출 (여러 기억을 묶어서 처리)
-     *
-     * @param newMemories 새로운 기억 목록
-     * @param existingMemories 기존 기억 목록
-     * @param options 추출 옵션 (batchSize 포함 가능)
-     * @returns 각 새로운 기억별 관계 후보 맵
-     */
-    extractRelationsBatch(newMemories: MemoryItem[], existingMemories: MemoryItem[], options?: ExtractOptions & {
-        batchSize?: number;
-    }): Promise<Map<string, RelationCandidate[]>>;
-    /**
-     * 비용 통계 조회
-     */
-    getCostMetrics(): LLMCostMetrics;
-    /**
-     * 비용 통계 초기화
-     */
-    resetCostMetrics(): void;
-}
-export {};
-//# sourceMappingURL=llm-based-relation-extractor.d.ts.map

package/dist/services/llm-based-relation-extractor.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"llm-based-relation-extractor.d.ts","sourceRoot":"","sources":["../../src/services/llm-based-relation-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAOH,OAAO,KAAK,EACV,iBAAiB,EACjB,YAAY,EACZ,kBAAkB,EAClB,cAAc,EACf,MAAM,sBAAsB,CAAC;AAE9B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAoBpD;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,KAAK,CAAC;QACf,SAAS,EAAE,MAAM,CAAC;QAClB,aAAa,EAAE,YAAY,CAAC;QAC5B,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,CAAC,EAAE,MAAM,CAAC;KACpB,CAAC,CAAC;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAyED;;GAEG;AACH,UAAU,cAAc;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,qBAAa,yBAA0B,YAAW,kBAAkB;IAClE,OAAO,CAAC,YAAY,CAAuB;IAC3C,OAAO,CAAC,YAAY,CAAmC;IACvD,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAwC;IAC1E,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAA0B;IAC3D,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoC;IAC1D,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAyB;IACrD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAiB;;IAe7C;;;;;;;OAOG;IACH,OAAO,CAAC,iBAAiB;IAsGzB;;OAEG;IACH,WAAW,IAAI,OAAO;IAQtB;;OAEG;IACH,OAAO,CAAC,WAAW;IAqCnB;;;OAGG;YACW,2BAA2B;IAyEzC;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAcxB;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAIxB;;;;;;;;OAQG;IACH,OAAO,CAAC,mBAAmB;IA0C3B;;OAEG;YACW,iBAAiB;IAqD/B;;OAEG;YACW,gBAAgB;IAwB9B;;OAEG;YACW,iBAAiB;IAuV/B;;OAEG;YACW,iBAAiB;IAqD/B;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW;IAsInB;;;;;;OAMG;IACH,OAAO,CAAC,gBAAgB;IA2OxB;;;;;;;OAOG;IACG,gBAAgB,CACpB,SAAS,EAAE,UAAU,EACrB,gBAAgB,EAAE,UAAU,EAAE,EAC9B,OAAO,CAAC,EAAE,cAAc,GACvB,OAAO,CAAC,iBAAiB,EAAE,CAAC;IAqH/B;;;;;;;OAOG;IACG,qBAAqB,CACzB,WAAW,EAAE,UAAU,EAAE,EACzB,gBAAgB,EAAE,UAAU,EAAE,EAC9B,OAAO,CAAC,EAAE,cAAc,GAAG;QAAE,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,GAChD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,EAAE,CAAC,CAAC;IAgC5C;;OAEG;IACH,cAAc,IAAI,cAAc;IAIhC;;OAEG;IACH,gBAAgB,IAAI,IAAI;CAMzB"}