Budget search aliases using the database parser

When adding aliases to PostgreSQL full-text search, verify each spelling through the real text-search configuration and count parsed query nodes rather than raw words. A hyphenated product name can produce compound and component lexemes, while a concatenated spelling can match nothing. Expand whole AND branches so OR alternatives retain the original constraints, and preserve the original query when the expanded Boolean budget would be exceeded. This supports bounded deterministic expansion; it does not establish semantic equivalence or population recall. Keep expansion optional when aliases broaden ambiguous names.

Applies when: A bounded lexical search API adds product or acronym aliases. Keywords: PostgreSQL aliases tokenizer lexemes Boolean OR query budget fulltext