Patent ID: 8745065

Claim:
A computer-implemented method, comprising: parsing an input entry received from a user for map search into a token sequence containing a plurality of tokens, each token comprising a term which represents a segment of the input entry and a type annotated to the term; determining possible splitting positions of the token sequence, wherein each possible splitting position splits the token sequence into a possible location subsequence containing location information and a possible query subsequence indicating a search target, wherein the possible splitting positions include a position between two adjacent tokens of the token sequence, a position before the first token of the token sequence, or a position after the last of the token sequence, wherein determining the possible splitting positions of the token sequence comprises: determining, for each possible splitting position, a location statistic score and a query statistic score for each of two token subsequences generated from the possible splitting position; and identifying the token subsequence with a higher location statistic score as the possible location subsequence, and the other token subsequence as the possible query subsequence, wherein the location statistic score or query statistic score for a token subsequence is based on scores of items appearing in the token subsequence and scores of item types appearing in the token subsequence; determining a splitting score for each of the possible splitting positions; selecting a location subsequence and a query subsequence from the possible splitting position having the highest splitting score; and searching for information responsive to the query subsequence with a location that is near the location indicated by the location subsequence.