12. The system of claim 11 , wherein the reformulator is operable to compare the generated candidates of the query with the candidates in the three sub-dictionaries, and automatically submit to the search engine the generated candidates that are found in either the must-split or the must-join sub-dictionaries; and the language modeler is operable to apply the language model to the generated candidates that are found in the normal sub-dictionary.
12. The system of claim 11 , wherein the reformulator is operable to compare the generated candidates of the query with the candidates in the three sub-dictionaries, and automatically submit to the search engine the generated candidates that are found in either the must-split or the must-join sub-dictionaries; and the language modeler is operable to apply the language model to the generated candidates that are found in the normal sub-dictionary. 13. The system of claim 12 , wherein the language modeler is operable to: determine a probability that the generated candidates found in the normal sub-dictionary may be found in the query logs based on a frequency of their occurrence therein; rank the normal generated candidates of the reformulated query based on their respective probabilities; and rewrite the query using a highest-ranked, normal generated candidate for submission to the search engine, wherein the highest-ranked reformulated query is different from the query originally accepted.