photon-grid-core 0.0.1

package/photon-ai/entity-resolver.d.ts

@@ -0,0 +1,121 @@
+import type { ColumnDef, ColumnDropdownOption } from '../types/column.types';
+import type { FilterOperator } from '../types/filter.types';
+import type { GridApi } from '../core/grid-api';
+import type { PhotonAIMemoryStore } from './photon-ai-memory';
+/** Result of {@link EntityResolver.resolveOperator} — the detected operator plus whatever tokens weren't consumed by its phrase. */
+export interface OperatorMatch {
+    readonly operator: FilterOperator | null;
+    readonly remaining: string[];
+}
+/** Result of {@link EntityResolver.resolveColumnByValue} — a column guessed purely from a value, with no column name mentioned. */
+export interface ValueMatch {
+    readonly column: ColumnDef;
+    readonly rawValue: string;
+}
+/**
+ * Extracts grid entities (columns, directions, values, filter operators, …)
+ * from the leftover tokens an {@link IntentDefinition} receives after
+ * intent-keyword removal. Columns are **never** hardcoded — every lookup is
+ * against the grid's *current* `ColumnDef[]`, resolved fuzzily
+ * (case-insensitive, substring, and edit-distance tolerant) so `"Salary"`,
+ * `"employee salary"`, and `"salery"` all resolve to the same column.
+ *
+ * Stateless aside from the optional {@link PhotonAIMemoryStore}, which lets
+ * a fuzzy column match resolved once (e.g. "emp name" → the `name` column)
+ * become an exact, instant hit on every later prompt.
+ */
+export declare class EntityResolver {
+    private readonly memory?;
+    constructor(memory?: PhotonAIMemoryStore | undefined);
+    /**
+     * Finds the single best-matching column for a set of candidate tokens.
+     * Checks learned aliases first, then tries the whole remaining phrase (so
+     * multi-word column names like "employee salary" resolve directly), then
+     * falls back to individual tokens (so a typo'd single word like "salery"
+     * still resolves, and so noise words like operators/values sitting next
+     * to a column name don't prevent a match).
+     */
+    resolveColumn(tokens: readonly string[], columns: readonly ColumnDef[]): ColumnDef | null;
+    /**
+     * Resolves every column named in a list — used by intents that can take
+     * more than one column at once (e.g. "pin price and income to the right",
+     * "unpin status, income and year", "group by department and status").
+     * Greedily tries the longest token window first at each position so a
+     * multi-word header like "Album Name" resolves as one column rather than
+     * two, but multi-word windows require an *exact* colId/field/header match
+     * (no fuzzy leniency) — otherwise the substring rule that lets "employee
+     * salary" resolve to "Salary" would just as happily let "price income"
+     * swallow both "Price" and "Income" as one bogus match. A single token
+     * still gets the full fuzzy/typo-tolerant treatment. Tokens that match
+     * nothing (list connectors like "and", stray words) are skipped rather
+     * than aborting the whole list.
+     */
+    resolveColumns(tokens: readonly string[], columns: readonly ColumnDef[]): ColumnDef[];
+    /** `'asc'` if any ascending-leaning word is present, `'desc'` if any descending-leaning word is present, else `null`. */
+    resolveDirection(tokens: readonly string[]): 'asc' | 'desc' | null;
+    /** `'left'` / `'right'` if present, else `null` (meaning "unpin" for pin-side intents). */
+    resolveSide(tokens: readonly string[]): 'left' | 'right' | null;
+    /** The first bare integer found in the tokens (e.g. `"select row 5"` → `5`), or `null`. */
+    resolveIndex(tokens: readonly string[]): number | null;
+    /** `true` when the tokens refer to "all"/"every" rather than one named thing (e.g. "hide all columns"). */
+    resolveAllRequested(tokens: readonly string[]): boolean;
+    /**
+     * Joins whatever tokens remain after a column has already been consumed
+     * from them — the free-text "value" a filter intent applies (e.g. in
+     * `"filter status active"`, once `status` resolves to a column, `"active"`
+     * is the value). Strips every individual word of the column's name
+     * (colId/field/header), not just an exact whole-phrase match, so
+     * multi-word headers like "Album Name" are fully removed.
+     */
+    extractValue(tokens: readonly string[], consumedColumn: ColumnDef | null): string | null;
+    /** Same as {@link extractValue} but returns the leftover tokens as an array (for further operator/value parsing) instead of a joined string. */
+    stripColumnTokens(tokens: readonly string[], consumedColumn: ColumnDef | null): string[];
+    /** Strips a single leading/anywhere "not" token, reporting whether negation was present so callers can flip their chosen operator. */
+    resolveNegation(tokens: readonly string[]): {
+        negated: boolean;
+        remaining: string[];
+    };
+    /**
+     * Detects a comparison-operator phrase (e.g. "greater than", "starts
+     * with", "before") anywhere in `tokens` and returns it along with the
+     * tokens that are left after removing that phrase's words. Returns
+     * `operator: null` (and the original tokens, untouched) when no phrase
+     * matches, so callers can fall back to a type-appropriate default.
+     */
+    resolveOperator(tokens: readonly string[]): OperatorMatch;
+    /** Splits `"between 10 and 50"`-style tokens into their two bounds, or `null` when no `between ... and ...` pattern is present. */
+    resolveRange(tokens: readonly string[]): {
+        from: string[];
+        to: string[];
+    } | null;
+    /** Parses a free-text number, tolerant of a leading currency symbol or trailing `%`. */
+    parseNumberToken(raw: string): number | null;
+    /** Parses a date token — ISO/slash-formatted dates plus "today"/"yesterday"/"tomorrow". */
+    parseDateToken(raw: string): Date | null;
+    /** Maps a boolean-leaning word ("active", "yes", "disabled", …) to `true`/`false`, or `null` when it isn't one. */
+    parseBooleanToken(raw: string): boolean | null;
+    /** Finds the best matching dropdown/enum option for a free-text value against one already-known column. */
+    matchOption(rawValue: string, column: ColumnDef): ColumnDropdownOption | null;
+    /**
+     * Guesses which column a free-text value belongs to when the user never
+     * named one (e.g. "show active items" — "active" is a `Status` dropdown
+     * option, not a column reference). Tries, in order: dropdown/enum option
+     * labels, boolean-leaning words, then a bounded scan of live row data for
+     * an exact match — each step only runs across columns still marked
+     * `filterable !== false`, and the raw-data scan is capped at
+     * {@link MAX_VALUE_SCAN_ROWS} rows so cost never scales with grid size.
+     */
+    resolveColumnByValue(tokens: readonly string[], columns: readonly ColumnDef[], api: GridApi): ValueMatch | null;
+    private scanRowDataForValue;
+    private scoreCandidate;
+    /**
+     * Scores a free-text value phrase against one dropdown/enum option label.
+     * Combines the direct string score (handles typos, e.g. "innactive") with
+     * a word-coverage score that ignores connector words on both sides (e.g.
+     * "of") — so a candidate like "record out stock" (extra noise word,
+     * missing "of") still confidently matches the label "Out of Stock" as
+     * long as every *meaningful* label word is present somewhere in it.
+     */
+    private optionScore;
+}
+//# sourceMappingURL=entity-resolver.d.ts.map

package/photon-ai/entity-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-resolver.d.ts","sourceRoot":"","sources":["../../src/photon-ai/entity-resolver.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC7E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEhD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAyD9D,oIAAoI;AACpI,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,QAAQ,EAAE,cAAc,GAAG,IAAI,CAAC;IACzC,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC;CAC9B;AAED,mIAAmI;AACnI,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAoBD;;;;;;;;;;;GAWG;AACH,qBAAa,cAAc;IACb,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAP,MAAM,CAAC,EAAE,mBAAmB,YAAA;IAEzD;;;;;;;OAOG;IACH,aAAa,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG,SAAS,GAAG,IAAI;IAgCzF;;;;;;;;;;;;;OAaG;IACH,cAAc,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG,SAAS,EAAE;IA8BrF,yHAAyH;IACzH,gBAAgB,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,KAAK,GAAG,MAAM,GAAG,IAAI;IASlE,2FAA2F;IAC3F,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI;IAO/D,2FAA2F;IAC3F,YAAY,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI;IAOtD,2GAA2G;IAC3G,mBAAmB,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO;IAIvD;;;;;;;OAOG;IACH,YAAY,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,cAAc,EAAE,SAAS,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI;IAKxF,gJAAgJ;IAChJ,iBAAiB,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,cAAc,EAAE,SAAS,GAAG,IAAI,GAAG,MAAM,EAAE;IAMxF,sIAAsI;IACtI,eAAe,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE;IAMrF;;;;;;OAMG;IACH,eAAe,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,aAAa;IAWzD,mIAAmI;IACnI,YAAY,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG;QAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAAC,EAAE,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,IAAI;IAYhF,wFAAwF;IACxF,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAO5C,2FAA2F;IAC3F,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAWxC,mHAAmH;IACnH,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,GAAG,IAAI;IAO9C,2GAA2G;IAC3G,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,oBAAoB,GAAG,IAAI;IAmB7E;;;;;;;;OAQG;IACH,oBAAoB,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,SAAS,SAAS,EAAE,EAAE,GAAG,EAAE,OAAO,GAAG,UAAU,GAAG,IAAI;IAiC/G,OAAO,CAAC,mBAAmB;IAmB3B,OAAO,CAAC,cAAc;IAMtB;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW;CAapB"}

package/photon-ai/entity-resolver.js

@@ -0,0 +1,393 @@
+import { similarity } from './fuzzy-match';
+/** Below this similarity score a fuzzy column match is rejected rather than guessed at. */
+const MIN_COLUMN_SIMILARITY = 0.6;
+/** Higher bar for guessing a column purely from a *value* (e.g. "active" → the Status column) — a wrong guess here silently filters the wrong column, so false positives are costlier than for column-name matching. */
+const MIN_VALUE_MATCH_SIMILARITY = 0.75;
+/** Upper bound on rows scanned when guessing a column from raw cell data — keeps worst-case cost flat regardless of grid size. */
+const MAX_VALUE_SCAN_ROWS = 300;
+const BOOLEAN_TRUE_WORDS = new Set(['true', 'yes', 'active', 'enabled', 'on', 'open']);
+const BOOLEAN_FALSE_WORDS = new Set(['false', 'no', 'inactive', 'disabled', 'off', 'closed']);
+/** Connector words dropped only when comparing a value phrase against a dropdown/enum option's label — never touches the tokens actually used for intent matching. Lets "record out stock" still match the option label "Out of Stock" despite the "of" the user's phrase never had and the "record" it has that the label doesn't. */
+const OPTION_LABEL_STOPWORDS = new Set(['of', 'the', 'a', 'an', 'and', 'or']);
+/** Longest column-name span (in tokens) {@link EntityResolver.resolveColumns} will try to match as one unit, so multi-word headers ("Album Name") resolve in a list without over-matching. */
+const MAX_COLUMN_PHRASE_WORDS = 3;
+const OPERATOR_PHRASE_TABLE = [
+    { words: ['greater', 'than', 'or', 'equal'], operator: 'greaterThanOrEqual' },
+    { words: ['less', 'than', 'or', 'equal'], operator: 'lessThanOrEqual' },
+    { words: ['no', 'less', 'than'], operator: 'greaterThanOrEqual' },
+    { words: ['no', 'more', 'than'], operator: 'lessThanOrEqual' },
+    { words: ['not', 'equal'], operator: 'notEquals' },
+    { words: ['not', 'blank'], operator: 'notBlank' },
+    { words: ['not', 'empty'], operator: 'notBlank' },
+    { words: ['at', 'least'], operator: 'greaterThanOrEqual' },
+    { words: ['at', 'most'], operator: 'lessThanOrEqual' },
+    { words: ['start', 'with'], operator: 'startsWith' },
+    { words: ['end', 'with'], operator: 'endsWith' },
+    { words: ['greater', 'than'], operator: 'greaterThan' },
+    { words: ['more', 'than'], operator: 'greaterThan' },
+    { words: ['less', 'than'], operator: 'lessThan' },
+    { words: ['fewer', 'than'], operator: 'lessThan' },
+    { words: ['not', 'contain'], operator: 'notContains' },
+    { words: ['contain'], operator: 'contains' },
+    { words: ['over'], operator: 'greaterThan' },
+    { words: ['above'], operator: 'greaterThan' },
+    { words: ['under'], operator: 'lessThan' },
+    { words: ['below'], operator: 'lessThan' },
+    { words: ['before'], operator: 'before' },
+    { words: ['after'], operator: 'after' },
+    { words: ['equal'], operator: 'equals' },
+    { words: ['blank'], operator: 'blank' },
+    { words: ['empty'], operator: 'blank' },
+];
+/** Ordered by word count (longest phrase first) so "greater than or equal" is preferred over "greater than". */
+const OPERATOR_PHRASES = [...OPERATOR_PHRASE_TABLE].sort((a, b) => b.words.length - a.words.length);
+function normalizeWord(s) {
+    return s.toLowerCase().trim();
+}
+/** Every string on a column a user might plausibly type or misspell. */
+function candidateNamesFor(col) {
+    return [col.colId, col.field, col.header].filter((s) => !!s).map(normalizeWord);
+}
+/** Every individual word across a column's colId/field/header — used to strip the column reference out of leftover tokens once it's been resolved. */
+function candidateWordsFor(col) {
+    const words = new Set();
+    for (const name of candidateNamesFor(col)) {
+        for (const w of name.split(' '))
+            words.add(w);
+    }
+    return words;
+}
+/**
+ * Extracts grid entities (columns, directions, values, filter operators, …)
+ * from the leftover tokens an {@link IntentDefinition} receives after
+ * intent-keyword removal. Columns are **never** hardcoded — every lookup is
+ * against the grid's *current* `ColumnDef[]`, resolved fuzzily
+ * (case-insensitive, substring, and edit-distance tolerant) so `"Salary"`,
+ * `"employee salary"`, and `"salery"` all resolve to the same column.
+ *
+ * Stateless aside from the optional {@link PhotonAIMemoryStore}, which lets
+ * a fuzzy column match resolved once (e.g. "emp name" → the `name` column)
+ * become an exact, instant hit on every later prompt.
+ */
+export class EntityResolver {
+    constructor(memory) {
+        this.memory = memory;
+    }
+    /**
+     * Finds the single best-matching column for a set of candidate tokens.
+     * Checks learned aliases first, then tries the whole remaining phrase (so
+     * multi-word column names like "employee salary" resolve directly), then
+     * falls back to individual tokens (so a typo'd single word like "salery"
+     * still resolves, and so noise words like operators/values sitting next
+     * to a column name don't prevent a match).
+     */
+    resolveColumn(tokens, columns) {
+        if (tokens.length === 0 || columns.length === 0)
+            return null;
+        const phrase = tokens.map(normalizeWord).join(' ');
+        const learnedColId = this.memory?.getColumnAlias(phrase);
+        if (learnedColId) {
+            const learned = columns.find((c) => c.colId === learnedColId);
+            if (learned)
+                return learned;
+        }
+        const candidates = [phrase, ...tokens.map(normalizeWord)].filter((c) => c.length > 0);
+        let best = null;
+        let bestScore = 0;
+        for (const col of columns) {
+            const names = candidateNamesFor(col);
+            for (const candidate of candidates) {
+                for (const name of names) {
+                    const score = this.scoreCandidate(candidate, name);
+                    if (score > bestScore) {
+                        bestScore = score;
+                        best = col;
+                    }
+                }
+            }
+        }
+        if (!best || bestScore < MIN_COLUMN_SIMILARITY)
+            return null;
+        if (bestScore < 1)
+            this.memory?.learnColumnAlias(phrase, best.colId);
+        return best;
+    }
+    /**
+     * Resolves every column named in a list — used by intents that can take
+     * more than one column at once (e.g. "pin price and income to the right",
+     * "unpin status, income and year", "group by department and status").
+     * Greedily tries the longest token window first at each position so a
+     * multi-word header like "Album Name" resolves as one column rather than
+     * two, but multi-word windows require an *exact* colId/field/header match
+     * (no fuzzy leniency) — otherwise the substring rule that lets "employee
+     * salary" resolve to "Salary" would just as happily let "price income"
+     * swallow both "Price" and "Income" as one bogus match. A single token
+     * still gets the full fuzzy/typo-tolerant treatment. Tokens that match
+     * nothing (list connectors like "and", stray words) are skipped rather
+     * than aborting the whole list.
+     */
+    resolveColumns(tokens, columns) {
+        const resolved = [];
+        const seen = new Set();
+        let i = 0;
+        while (i < tokens.length) {
+            let consumed = 1;
+            let match = null;
+            for (let windowSize = Math.min(MAX_COLUMN_PHRASE_WORDS, tokens.length - i); windowSize >= 2; windowSize--) {
+                const phrase = tokens.slice(i, i + windowSize).map(normalizeWord).join(' ');
+                const exact = columns.find((c) => candidateNamesFor(c).includes(phrase));
+                if (exact) {
+                    match = exact;
+                    consumed = windowSize;
+                    break;
+                }
+            }
+            if (!match)
+                match = this.resolveColumn([tokens[i]], columns);
+            if (match && !seen.has(match.colId)) {
+                seen.add(match.colId);
+                resolved.push(match);
+            }
+            i += consumed;
+        }
+        return resolved;
+    }
+    /** `'asc'` if any ascending-leaning word is present, `'desc'` if any descending-leaning word is present, else `null`. */
+    resolveDirection(tokens) {
+        const words = new Set(tokens.map(normalizeWord));
+        const ascending = ['asc', 'ascending', 'low', 'smallest', 'increasing'];
+        const descending = ['desc', 'descending', 'high', 'largest', 'decreasing'];
+        if (descending.some((w) => words.has(w)))
+            return 'desc';
+        if (ascending.some((w) => words.has(w)))
+            return 'asc';
+        return null;
+    }
+    /** `'left'` / `'right'` if present, else `null` (meaning "unpin" for pin-side intents). */
+    resolveSide(tokens) {
+        const words = new Set(tokens.map(normalizeWord));
+        if (words.has('left'))
+            return 'left';
+        if (words.has('right'))
+            return 'right';
+        return null;
+    }
+    /** The first bare integer found in the tokens (e.g. `"select row 5"` → `5`), or `null`. */
+    resolveIndex(tokens) {
+        for (const token of tokens) {
+            if (/^\d+$/.test(token))
+                return parseInt(token, 10);
+        }
+        return null;
+    }
+    /** `true` when the tokens refer to "all"/"every" rather than one named thing (e.g. "hide all columns"). */
+    resolveAllRequested(tokens) {
+        return tokens.some((t) => normalizeWord(t) === 'all');
+    }
+    /**
+     * Joins whatever tokens remain after a column has already been consumed
+     * from them — the free-text "value" a filter intent applies (e.g. in
+     * `"filter status active"`, once `status` resolves to a column, `"active"`
+     * is the value). Strips every individual word of the column's name
+     * (colId/field/header), not just an exact whole-phrase match, so
+     * multi-word headers like "Album Name" are fully removed.
+     */
+    extractValue(tokens, consumedColumn) {
+        const remaining = this.stripColumnTokens(tokens, consumedColumn);
+        return remaining.length ? remaining.join(' ') : null;
+    }
+    /** Same as {@link extractValue} but returns the leftover tokens as an array (for further operator/value parsing) instead of a joined string. */
+    stripColumnTokens(tokens, consumedColumn) {
+        if (!consumedColumn)
+            return [...tokens];
+        const consumedWords = candidateWordsFor(consumedColumn);
+        return tokens.filter((t) => !consumedWords.has(normalizeWord(t)));
+    }
+    /** Strips a single leading/anywhere "not" token, reporting whether negation was present so callers can flip their chosen operator. */
+    resolveNegation(tokens) {
+        const idx = tokens.map(normalizeWord).indexOf('not');
+        if (idx < 0)
+            return { negated: false, remaining: [...tokens] };
+        return { negated: true, remaining: [...tokens.slice(0, idx), ...tokens.slice(idx + 1)] };
+    }
+    /**
+     * Detects a comparison-operator phrase (e.g. "greater than", "starts
+     * with", "before") anywhere in `tokens` and returns it along with the
+     * tokens that are left after removing that phrase's words. Returns
+     * `operator: null` (and the original tokens, untouched) when no phrase
+     * matches, so callers can fall back to a type-appropriate default.
+     */
+    resolveOperator(tokens) {
+        const words = tokens.map(normalizeWord);
+        for (const { words: phrase, operator } of OPERATOR_PHRASES) {
+            const start = indexOfSubsequence(words, phrase);
+            if (start < 0)
+                continue;
+            const remaining = [...words.slice(0, start), ...words.slice(start + phrase.length)];
+            return { operator, remaining };
+        }
+        return { operator: null, remaining: [...words] };
+    }
+    /** Splits `"between 10 and 50"`-style tokens into their two bounds, or `null` when no `between ... and ...` pattern is present. */
+    resolveRange(tokens) {
+        const words = tokens.map(normalizeWord);
+        const betweenIdx = words.indexOf('between');
+        if (betweenIdx < 0)
+            return null;
+        const andIdx = words.indexOf('and', betweenIdx + 1);
+        if (andIdx < 0)
+            return null;
+        const from = words.slice(betweenIdx + 1, andIdx);
+        const to = words.slice(andIdx + 1);
+        if (from.length === 0 || to.length === 0)
+            return null;
+        return { from, to };
+    }
+    /** Parses a free-text number, tolerant of a leading currency symbol or trailing `%`. */
+    parseNumberToken(raw) {
+        const cleaned = raw.replace(/[^0-9.\-]/g, '');
+        if (!cleaned)
+            return null;
+        const value = Number(cleaned);
+        return Number.isNaN(value) ? null : value;
+    }
+    /** Parses a date token — ISO/slash-formatted dates plus "today"/"yesterday"/"tomorrow". */
+    parseDateToken(raw) {
+        const word = normalizeWord(raw);
+        const now = new Date();
+        if (word === 'today')
+            return now;
+        if (word === 'yesterday')
+            return new Date(now.getTime() - 86400000);
+        if (word === 'tomorrow')
+            return new Date(now.getTime() + 86400000);
+        if (!/\d/.test(word))
+            return null;
+        const parsed = new Date(word);
+        return Number.isNaN(parsed.getTime()) ? null : parsed;
+    }
+    /** Maps a boolean-leaning word ("active", "yes", "disabled", …) to `true`/`false`, or `null` when it isn't one. */
+    parseBooleanToken(raw) {
+        const word = normalizeWord(raw);
+        if (BOOLEAN_TRUE_WORDS.has(word))
+            return true;
+        if (BOOLEAN_FALSE_WORDS.has(word))
+            return false;
+        return null;
+    }
+    /** Finds the best matching dropdown/enum option for a free-text value against one already-known column. */
+    matchOption(rawValue, column) {
+        const candidate = normalizeWord(rawValue);
+        if (!candidate)
+            return null;
+        const options = column.dropdownOptions ?? column.enumOptions?.map((v) => ({ value: v, label: v })) ?? [];
+        let best = null;
+        let bestScore = 0;
+        for (const option of options) {
+            const score = this.optionScore(candidate, String(option.label));
+            if (score > bestScore) {
+                bestScore = score;
+                best = option;
+            }
+        }
+        return bestScore >= MIN_VALUE_MATCH_SIMILARITY ? best : null;
+    }
+    /**
+     * Guesses which column a free-text value belongs to when the user never
+     * named one (e.g. "show active items" — "active" is a `Status` dropdown
+     * option, not a column reference). Tries, in order: dropdown/enum option
+     * labels, boolean-leaning words, then a bounded scan of live row data for
+     * an exact match — each step only runs across columns still marked
+     * `filterable !== false`, and the raw-data scan is capped at
+     * {@link MAX_VALUE_SCAN_ROWS} rows so cost never scales with grid size.
+     */
+    resolveColumnByValue(tokens, columns, api) {
+        if (tokens.length === 0)
+            return null;
+        const phrase = tokens.map(normalizeWord).join(' ');
+        const candidates = [phrase, ...tokens.map(normalizeWord)].filter((c) => c.length > 0);
+        const filterableColumns = columns.filter((c) => c.filterable !== false);
+        let best = null;
+        let bestScore = 0;
+        for (const col of filterableColumns) {
+            const options = col.dropdownOptions ?? col.enumOptions?.map((v) => ({ value: v, label: v })) ?? [];
+            for (const candidate of candidates) {
+                for (const option of options) {
+                    const score = this.optionScore(candidate, String(option.label));
+                    if (score > bestScore) {
+                        bestScore = score;
+                        best = { column: col, rawValue: String(option.value) };
+                    }
+                }
+                if (col.type === 'boolean' && this.parseBooleanToken(candidate) !== null) {
+                    if (1 > bestScore) {
+                        bestScore = 1;
+                        best = { column: col, rawValue: candidate };
+                    }
+                }
+            }
+        }
+        if (best && bestScore >= MIN_VALUE_MATCH_SIMILARITY)
+            return best;
+        return this.scanRowDataForValue(phrase, filterableColumns, api);
+    }
+    scanRowDataForValue(phrase, columns, api) {
+        if (phrase.length < 3)
+            return null;
+        const scannable = columns.filter((c) => c.type === 'string' || c.type === 'dropdown' || c.type === 'email');
+        if (scannable.length === 0)
+            return null;
+        const rows = api.getAllRows();
+        const limit = Math.min(rows.length, MAX_VALUE_SCAN_ROWS);
+        for (let i = 0; i < limit; i++) {
+            const data = rows[i].data;
+            for (const col of scannable) {
+                const cell = data[col.field];
+                if (cell != null && normalizeWord(String(cell)) === phrase) {
+                    return { column: col, rawValue: String(cell) };
+                }
+            }
+        }
+        return null;
+    }
+    scoreCandidate(candidate, name) {
+        if (candidate === name)
+            return 1;
+        if (candidate.length >= 3 && (name.includes(candidate) || candidate.includes(name)))
+            return 0.9;
+        return similarity(candidate, name);
+    }
+    /**
+     * Scores a free-text value phrase against one dropdown/enum option label.
+     * Combines the direct string score (handles typos, e.g. "innactive") with
+     * a word-coverage score that ignores connector words on both sides (e.g.
+     * "of") — so a candidate like "record out stock" (extra noise word,
+     * missing "of") still confidently matches the label "Out of Stock" as
+     * long as every *meaningful* label word is present somewhere in it.
+     */
+    optionScore(candidate, optionLabel) {
+        const label = normalizeWord(optionLabel);
+        const direct = this.scoreCandidate(candidate, label);
+        const candidateWords = new Set(candidate.split(' ').filter((w) => w.length > 0));
+        const labelWords = label.split(' ').filter((w) => w.length > 0 && !OPTION_LABEL_STOPWORDS.has(w));
+        if (labelWords.length === 0)
+            return direct;
+        const coverage = labelWords.filter((w) => candidateWords.has(w)).length / labelWords.length;
+        const coverageScore = coverage === 1 ? 0.95 : coverage * 0.7;
+        return Math.max(direct, coverageScore);
+    }
+}
+/** Index of the first occurrence of `needle` as a contiguous subsequence of `haystack`, or `-1`. */
+function indexOfSubsequence(haystack, needle) {
+    if (needle.length === 0 || needle.length > haystack.length)
+        return -1;
+    outer: for (let i = 0; i <= haystack.length - needle.length; i++) {
+        for (let j = 0; j < needle.length; j++) {
+            if (haystack[i + j] !== needle[j])
+                continue outer;
+        }
+        return i;
+    }
+    return -1;
+}
+//# sourceMappingURL=entity-resolver.js.map

package/photon-ai/entity-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-resolver.js","sourceRoot":"","sources":["../../src/photon-ai/entity-resolver.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAG3C,2FAA2F;AAC3F,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAClC,wNAAwN;AACxN,MAAM,0BAA0B,GAAG,IAAI,CAAC;AACxC,kIAAkI;AAClI,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,MAAM,kBAAkB,GAAwB,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAC5G,MAAM,mBAAmB,GAAwB,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;AAEnH,uUAAuU;AACvU,MAAM,sBAAsB,GAAwB,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AAEnG,8LAA8L;AAC9L,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAOlC,MAAM,qBAAqB,GAA8B;IACvD,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,oBAAoB,EAAE;IAC7E,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE;IACvE,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,oBAAoB,EAAE;IACjE,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE;IAC9D,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,WAAW,EAAE;IAClD,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IACjD,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IACjD,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,oBAAoB,EAAE;IAC1D,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE;IACtD,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE;IACpD,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IAChD,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAE;IACvD,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAE;IACpD,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IACjD,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IAClD,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAE;IACtD,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IAC5C,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAE;IAC5C,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAE;IAC7C,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IAC1C,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE;IAC1C,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;IACzC,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE;IACvC,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE;IACxC,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE;IACvC,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE;CACxC,CAAC;AAEF,gHAAgH;AAChH,MAAM,gBAAgB,GAA8B,CAAC,GAAG,qBAAqB,CAAC,CAAC,IAAI,CACjF,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAC1C,CAAC;AAcF,SAAS,aAAa,CAAC,CAAS;IAC9B,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,wEAAwE;AACxE,SAAS,iBAAiB,CAAC,GAAc;IACvC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;AAC/F,CAAC;AAED,sJAAsJ;AACtJ,SAAS,iBAAiB,CAAC,GAAc;IACvC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,cAAc;IACzB,YAA6B,MAA4B;QAA5B,WAAM,GAAN,MAAM,CAAsB;IAAG,CAAC;IAE7D;;;;;;;OAOG;IACH,aAAa,CAAC,MAAyB,EAAE,OAA6B;QACpE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE7D,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC;QACzD,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,YAAY,CAAC,CAAC;YAC9D,IAAI,OAAO;gBAAE,OAAO,OAAO,CAAC;QAC9B,CAAC;QAED,MAAM,UAAU,GAAG,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEtF,IAAI,IAAI,GAAqB,IAAI,CAAC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;YACrC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;oBACnD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;wBACtB,SAAS,GAAG,KAAK,CAAC;wBAClB,IAAI,GAAG,GAAG,CAAC;oBACb,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,IAAI,SAAS,GAAG,qBAAqB;YAAE,OAAO,IAAI,CAAC;QAC5D,IAAI,SAAS,GAAG,CAAC;YAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,cAAc,CAAC,MAAyB,EAAE,OAA6B;QACrE,MAAM,QAAQ,GAAgB,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,KAAK,GAAqB,IAAI,CAAC;YAEnC,KAAK,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,uBAAuB,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,UAAU,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;gBAC1G,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC5E,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBACzE,IAAI,KAAK,EAAE,CAAC;oBACV,KAAK,GAAG,KAAK,CAAC;oBACd,QAAQ,GAAG,UAAU,CAAC;oBACtB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,KAAK;gBAAE,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC7D,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACtB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;YACD,CAAC,IAAI,QAAQ,CAAC;QAChB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,yHAAyH;IACzH,gBAAgB,CAAC,MAAyB;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;QACxE,MAAM,UAAU,GAAG,CAAC,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QAC3E,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,MAAM,CAAC;QACxD,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACtD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2FAA2F;IAC3F,WAAW,CAAC,MAAyB;QACnC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;QACjD,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QACrC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2FAA2F;IAC3F,YAAY,CAAC,MAAyB;QACpC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2GAA2G;IAC3G,mBAAmB,CAAC,MAAyB;QAC3C,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,MAAyB,EAAE,cAAgC;QACtE,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QACjE,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAED,gJAAgJ;IAChJ,iBAAiB,CAAC,MAAyB,EAAE,cAAgC;QAC3E,IAAI,CAAC,cAAc;YAAE,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC;QACxC,MAAM,aAAa,GAAG,iBAAiB,CAAC,cAAc,CAAC,CAAC;QACxD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;IAED,sIAAsI;IACtI,eAAe,CAAC,MAAyB;QACvC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrD,IAAI,GAAG,GAAG,CAAC;YAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC;QAC/D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3F,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,MAAyB;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QACxC,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,gBAAgB,EAAE,CAAC;YAC3D,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAChD,IAAI,KAAK,GAAG,CAAC;gBAAE,SAAS;YACxB,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACpF,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;QACjC,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,mIAAmI;IACnI,YAAY,CAAC,MAAyB;QACpC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QACxC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,UAAU,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;QACpD,IAAI,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACtD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IACtB,CAAC;IAED,wFAAwF;IACxF,gBAAgB,CAAC,GAAW;QAC1B,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9B,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IAC5C,CAAC;IAED,2FAA2F;IAC3F,cAAc,CAAC,GAAW;QACxB,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,KAAK,OAAO;YAAE,OAAO,GAAG,CAAC;QACjC,IAAI,IAAI,KAAK,WAAW;YAAE,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,QAAU,CAAC,CAAC;QACtE,IAAI,IAAI,KAAK,UAAU;YAAE,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,QAAU,CAAC,CAAC;QACrE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACxD,CAAC;IAED,mHAAmH;IACnH,iBAAiB,CAAC,GAAW;QAC3B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9C,IAAI,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAChD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2GAA2G;IAC3G,WAAW,CAAC,QAAgB,EAAE,MAAiB;QAC7C,MAAM,SAAS,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QAE5B,MAAM,OAAO,GACX,MAAM,CAAC,eAAe,IAAI,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAE3F,IAAI,IAAI,GAAgC,IAAI,CAAC;QAC7C,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAChE,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,SAAS,GAAG,KAAK,CAAC;gBAClB,IAAI,GAAG,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,IAAI,0BAA0B,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,CAAC;IAED;;;;;;;;OAQG;IACH,oBAAoB,CAAC,MAAyB,EAAE,OAA6B,EAAE,GAAY;QACzF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACrC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtF,MAAM,iBAAiB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC;QAExE,IAAI,IAAI,GAAsB,IAAI,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;YACpC,MAAM,OAAO,GACX,GAAG,CAAC,eAAe,IAAI,GAAG,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YACrF,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;oBAChE,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;wBACtB,SAAS,GAAG,KAAK,CAAC;wBAClB,IAAI,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;oBACzD,CAAC;gBACH,CAAC;gBACD,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,CAAC;oBACzE,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC;wBAClB,SAAS,GAAG,CAAC,CAAC;wBACd,IAAI,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;oBAC9C,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,IAAI,IAAI,SAAS,IAAI,0BAA0B;YAAE,OAAO,IAAI,CAAC;QACjE,OAAO,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,iBAAiB,EAAE,GAAG,CAAC,CAAC;IAClE,CAAC;IAEO,mBAAmB,CAAC,MAAc,EAAE,OAA6B,EAAE,GAAY;QACrF,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QAC5G,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAExC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC1B,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC7B,IAAI,IAAI,IAAI,IAAI,IAAI,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;oBAC3D,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,cAAc,CAAC,SAAiB,EAAE,IAAY;QACpD,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QACjC,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,GAAG,CAAC;QAChG,OAAO,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;;;;;OAOG;IACK,WAAW,CAAC,SAAiB,EAAE,WAAmB;QACxD,MAAM,KAAK,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAErD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACjF,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClG,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAE3C,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;QAC5F,MAAM,aAAa,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC;QAE7D,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACzC,CAAC;CACF;AAED,oGAAoG;AACpG,SAAS,kBAAkB,CAAC,QAA2B,EAAE,MAAyB;IAChF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC;IACtE,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;gBAAE,SAAS,KAAK,CAAC;QACpD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC"}

package/photon-ai/fuzzy-match.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Classic Levenshtein edit distance (insertions + deletions + substitutions)
+ * between two strings. Single-row dynamic programming — O(n*m) time, O(min(n,m)) space.
+ */
+export declare function levenshteinDistance(a: string, b: string): number;
+/**
+ * Normalized similarity in `[0, 1]` — `1` for identical strings, `0` for
+ * completely dissimilar ones. Used to fuzzy-match typos in column names
+ * (e.g. "salery" vs "salary") without pulling in an external library.
+ */
+export declare function similarity(a: string, b: string): number;
+//# sourceMappingURL=fuzzy-match.d.ts.map

package/photon-ai/fuzzy-match.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fuzzy-match.d.ts","sourceRoot":"","sources":["../../src/photon-ai/fuzzy-match.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAqBhE;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAIvD"}

package/photon-ai/fuzzy-match.js

@@ -0,0 +1,37 @@
+/**
+ * Classic Levenshtein edit distance (insertions + deletions + substitutions)
+ * between two strings. Single-row dynamic programming — O(n*m) time, O(min(n,m)) space.
+ */
+export function levenshteinDistance(a, b) {
+    if (a === b)
+        return 0;
+    if (a.length === 0)
+        return b.length;
+    if (b.length === 0)
+        return a.length;
+    let prevRow = Array.from({ length: b.length + 1 }, (_, i) => i);
+    let currRow = new Array(b.length + 1);
+    for (let i = 1; i <= a.length; i++) {
+        currRow[0] = i;
+        for (let j = 1; j <= b.length; j++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            currRow[j] = Math.min(prevRow[j] + 1, // deletion
+            currRow[j - 1] + 1, // insertion
+            prevRow[j - 1] + cost);
+        }
+        [prevRow, currRow] = [currRow, prevRow];
+    }
+    return prevRow[b.length];
+}
+/**
+ * Normalized similarity in `[0, 1]` — `1` for identical strings, `0` for
+ * completely dissimilar ones. Used to fuzzy-match typos in column names
+ * (e.g. "salery" vs "salary") without pulling in an external library.
+ */
+export function similarity(a, b) {
+    const maxLen = Math.max(a.length, b.length);
+    if (maxLen === 0)
+        return 1;
+    return 1 - levenshteinDistance(a, b) / maxLen;
+}
+//# sourceMappingURL=fuzzy-match.js.map

package/photon-ai/fuzzy-match.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fuzzy-match.js","sourceRoot":"","sources":["../../src/photon-ai/fuzzy-match.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,CAAS;IACtD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IAEpC,IAAI,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAChE,IAAI,OAAO,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACnB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAO,WAAW;YAChC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAG,YAAY;YACjC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CACtB,CAAC;QACJ,CAAC;QACD,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3B,OAAO,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC;AAChD,CAAC"}

package/photon-ai/index.d.ts

@@ -0,0 +1,15 @@
+export { PhotonAIService } from './photon-ai-service';
+export { PhotonAIPanel } from './photon-ai-panel';
+export { PhotonAICommandRegistry } from './photon-ai-registry';
+export { IntentParser } from './intent-parser';
+export { EntityResolver } from './entity-resolver';
+export type { OperatorMatch, ValueMatch } from './entity-resolver';
+export { CommandBuilder } from './command-builder';
+export { CommandExecutor } from './command-executor';
+export { registerBuiltinCommands } from './builtins';
+export { normalizeInput, tokenize, stemWord } from './text-normalizer';
+export { splitClauses } from './query-splitter';
+export { PhotonAIMemoryStore, columnSignature } from './photon-ai-memory';
+export { levenshteinDistance, similarity } from './fuzzy-match';
+export type { PhotonCommand, PhotonCommandResult, ResolvedEntities, IntentDefinition, ParsedIntentMatch, } from './photon-ai.types';
+//# sourceMappingURL=index.d.ts.map

package/photon-ai/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/photon-ai/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,uBAAuB,EAAE,MAAM,YAAY,CAAC;AACrD,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChE,YAAY,EACV,aAAa,EACb,mBAAmB,EACnB,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,mBAAmB,CAAC"}

package/photon-ai/index.js

@@ -0,0 +1,13 @@
+export { PhotonAIService } from './photon-ai-service';
+export { PhotonAIPanel } from './photon-ai-panel';
+export { PhotonAICommandRegistry } from './photon-ai-registry';
+export { IntentParser } from './intent-parser';
+export { EntityResolver } from './entity-resolver';
+export { CommandBuilder } from './command-builder';
+export { CommandExecutor } from './command-executor';
+export { registerBuiltinCommands } from './builtins';
+export { normalizeInput, tokenize, stemWord } from './text-normalizer';
+export { splitClauses } from './query-splitter';
+export { PhotonAIMemoryStore, columnSignature } from './photon-ai-memory';
+export { levenshteinDistance, similarity } from './fuzzy-match';
+//# sourceMappingURL=index.js.map