11. The method of claim 10 , wherein the first text string and the second text string are alternative spellings of a same word, and wherein the first binary tree includes a plurality of nodes and each node has an indication of a frequency associated with one of the query suffix strings.
10. A computer-implemented method of creating an index of web queries, comprising: receiving a query representative of one or more non-alphanumeric symbolic characters; generating suffix strings that correspond to the query; incorporating the query suffix strings into a first binary tree; creating a first text string of alphanumeric characters representative of the one or more non-alphanumeric symbolic characters of the query; creating a second text string of alphanumeric characters representative of the one or more non-alphanumeric symbolic characters of the query, the second text string being different than the first text string generating suffix strings that correspond to the first and the second text strings; incorporating, with the use of a processor, the suffix strings of the first and the second text strings into a second binary tree; and associating the query suffix strings in the first binary tree with the suffix strings of the first and the second text strings in the second binary tree.