2. The computer-implemented method of claim 1 , wherein updating the segmentation database comprises, for at least one candidate pair of the refined set of candidate pairs, associating one or more documents with both the first query of the candidate pair and the second query of the candidate pair.
1. A computer-implemented method of processing search queries, comprising: under control of one or more computer systems configured with executable instructions, obtaining, using at least one computing device, behavioral information associated with a plurality of previously-submitted queries, the behavioral information associated with each previously-submitted query indicative of one or more actions taken by one or more of the corresponding searchers in connection with the previously-submitted query; identifying, from the obtained previously-submitted queries, a set of candidate pairs, each candidate pair including a first query and a second query, the first query including a set of separated words and the second query including a single word composed of a connected combination of at least a subset of the set of separated words, wherein the subset includes at least two words; refining, using at least one computing device, the set of candidate pairs by, for each member pair of at least a subset of the set of candidate pairs, at least: obtaining first search results corresponding to the first query of the member pair; obtaining second search results corresponding to the second query of the member pair; based at least in part on the first search results, the second search results, the obtained behavioral information associated with the first query of the member pair, and obtained behavioral information associated with the second query of the member pair, removing the member pair from the set of candidate pairs; updating, based at least in part on the refined set of candidate pairs, a segmentation database that includes a plurality of member pairs, wherein each member pair includes a first member comprising a set of separated words and a second member comprising a single word composed of a connected combination of at least a subset of the set of separated words of the first member; upon receiving a search query, comparing the search query against the plurality of member pairs in the segmentation database; upon identifying a corresponding member pair for the search query in the segmentation database, substituting the search query with the corresponding member pair; and processing the search query using the corresponding member pair.