8. A computer implemented query matching methodology coupled to a computer readable storage medium, said computer when executed by a processor causes the processor to perform the steps: generating a query table comprising preliminary query phrases and corresponding query keys; receiving a text and analyzing the received text to identify preliminary query phrases that match the received text; generating a canonical table comprising canonical expressions formed from original phrases of the preliminary query phrases or derivations thereof; generating a Boolean table defining root expression nodes, leaf expression nodes from the canonical expressions and defining logical relationships among the root and leaf expression nodes, wherein the Boolean table is populated the with child expression identifiers each corresponding to a respective child expression, Boolean weights for each child expression, parent expression identifiers, and parent expression target weights, and wherein said Boolean table produces the same parent expression identifier whenever the child expression identifiers and the Boolean weights are the same; and generating a final expression table comprising a mapping of root expression nodes to query keys based on the Boolean table.
8. A computer implemented query matching methodology coupled to a computer readable storage medium, said computer when executed by a processor causes the processor to perform the steps: generating a query table comprising preliminary query phrases and corresponding query keys; receiving a text and analyzing the received text to identify preliminary query phrases that match the received text; generating a canonical table comprising canonical expressions formed from original phrases of the preliminary query phrases or derivations thereof; generating a Boolean table defining root expression nodes, leaf expression nodes from the canonical expressions and defining logical relationships among the root and leaf expression nodes, wherein the Boolean table is populated the with child expression identifiers each corresponding to a respective child expression, Boolean weights for each child expression, parent expression identifiers, and parent expression target weights, and wherein said Boolean table produces the same parent expression identifier whenever the child expression identifiers and the Boolean weights are the same; and generating a final expression table comprising a mapping of root expression nodes to query keys based on the Boolean table. 10. The method of claim 8 , the generating the canonical table including deriving alternate expressions from the original phrases using thesaurus based or inflection based transformations.