CN103593364B - The method and system of keyword is filled in a kind of route search - Google Patents
The method and system of keyword is filled in a kind of route search Download PDFInfo
- Publication number
- CN103593364B CN103593364B CN201210291497.8A CN201210291497A CN103593364B CN 103593364 B CN103593364 B CN 103593364B CN 201210291497 A CN201210291497 A CN 201210291497A CN 103593364 B CN103593364 B CN 103593364B
- Authority
- CN
- China
- Prior art keywords
- starting point
- keyword
- keywords
- route search
- filling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of method that keyword is filled in route search, including：Gather the starting point relevant information of route search；One or more alternative starting point keywords are chosen from all starting point keywords in starting point relevant information；The alternative starting point keyword determined from one or more alternative starting point keywords is filled into the respective regions of the starting point of route search in WEB google maps；The invention also discloses the system that keyword is filled in a kind of route search, by means of the invention it is possible to which the input cost for making to carry out route search by WEB google maps is preferably minimized.
Description
Technical Field
The invention relates to the technical field of map route search, in particular to a method and a system for filling keywords in route search.
Background
Route searching means that a user inputs a starting point information and an end point information in a map search engine, and then a search system searches out one or more corresponding routes from the starting point to the end point. The routes include bus routes, driving routes or walking routes and the like.
When searching for a route in all existing map search engines, a user is required to input start point information in a start point box and end point information in an end point box, as shown in fig. 1. Since the start point information needs to be input in the start point box every time the route search is performed, the input cost is high. For example, assuming a user is an outdoor trip, the user will frequently use a map search engine to search for a route from home to a tourist attraction. Then, the user inputs the same start point, i.e., the location information of the home, in the start point frame of the map search engine every time the user performs a route search. Such frequent input of the same start point information not only increases the input cost but also brings a bad experience to the user.
In order to solve the problems, the route search of the mobile terminal provides a solution: in the map search engine, the start point information of the start point frame defaults to the current location information of the mobile terminal, and the end point information of the end point frame is still input by the user. This way, which greatly reduces the input cost in route searching, can be achieved because: with the development of mobile terminal technology, the current mobile terminals basically have a positioning function, and the mobile terminals can acquire the position information of the mobile terminals in real time through a GPS or similar Cellid positioning technology; in this way, when the user searches for a route using the map search engine of the mobile terminal, the start point information is filled as the current location information of the mobile terminal by default, and the user does not need to fill the start point information. If the origin is not the current location, the user may click on the origin box to modify. However, this method cannot be applied to a WEB map search engine because most PCs do not have a positioning function.
In addition, a scheme for reducing input cost in route search, namely search prompt, is also proposed in the prior art, and the specific method is as follows: after the user inputs a small amount of content, the system displays one or more related prompt words below the search box in real time according to the input small amount of content. After the user selects a certain prompt word from the search box, the prompt word is filled in the search box. Thus, the user does not have to enter the complete starting point information. However, this approach still requires the user to input a small amount of information, and the input cost is still high compared to the approach in which the system automatically fills the starting point information in the mobile terminal.
Disclosure of Invention
In view of the above, the main objective of the present invention is to provide a method and a system for filling keywords in route search, which solve the problem of high input cost when searching for a route using the existing WEB map search engine.
In order to achieve the purpose, the technical scheme of the invention is realized as follows:
the invention provides a method for filling keywords in route search, which comprises the following steps:
collecting starting point related information of route searching;
selecting one or more alternative starting point keywords from all the starting point keywords in the starting point related information;
and filling one alternative starting point keyword determined from the one or more alternative starting point keywords into a corresponding area of the starting point of the route search in the WEB map search engine.
The starting point related information at least comprises a starting point keyword and accumulated use times.
Collecting the starting point related information of the route search as follows: recording the relevant information of the starting point through Cookies;
the Cookies comprise one or more records, and each record is used for storing a starting point keyword and the corresponding accumulated use times.
Before the collecting the relevant information of the starting point, the method further comprises the following steps: determining the starting point related information as follows:
positioning a route search client, determining the geographic position of the route search client, and taking a keyword corresponding to the geographic position as the starting point keyword;
or determining the geographic position of the route search client according to the IP address of the route search client and the preset corresponding relation between the IP address and the geographic position, and taking the keyword corresponding to the geographic position as the starting point keyword.
Selecting one or more alternative starting point keywords from all the recorded starting point keywords according to the starting point related information, wherein the alternative starting point keywords comprise:
determining the probability of the starting point keyword according to the accumulated use times of the starting point keyword;
determining the information content of the starting point keyword according to the probability of the starting point keyword;
determining the entropy of a system formed by all the starting point keywords according to the information quantity of all the starting point keywords;
and selecting one or more alternative starting point keywords from all the recorded starting point keywords according to the accumulated use times of the starting point keywords, the information amount of the starting point keywords and the entropy.
Determining the probability of the starting point keyword according to the accumulated use times of the starting point keyword; comprises the following steps:
the probability of the ith starting point keyword is equal to the cumulative number of use of the ith starting point keyword divided by the sum of the cumulative number of use of each starting point keyword; the i is a positive integer;
determining the information amount of the starting point keyword according to the probability of the starting point keyword as follows: le (i) ═ log2p(i)；
Le (i) is the information content of the ith starting point keyword; the p (i) is the probability of the ith starting point keyword;
determining the entropy of a system formed by all the starting point keywords according to the information quantity of all the starting point keywords, wherein the entropy is as follows:the H is the entropy; 1,2,. n; n is a positive integer.
According to the accumulated use times of the starting point keywords, the information amount of the starting point keywords and the entropy, one or more alternative starting point keywords are selected from all the recorded starting point keywords, and the method comprises the following steps:
and traversing each record in the Cookies, and taking the starting point keyword corresponding to the current record as an alternative starting point keyword when the accumulated use times of the starting point keyword corresponding to the current record is greater than a preset threshold, the information amount of the starting point keyword corresponding to the current record is greater than the preset threshold, and the entropy is less than the preset threshold.
Filling one alternative starting point keyword determined from one or more alternative starting point keywords into a corresponding area of a starting point of route search in a WEB map search engine, wherein the method comprises the following steps:
when the number of the alternative starting point keywords is one, the alternative starting point keywords are directly filled in a corresponding area of a starting point of route search in a WEB map search engine; or,
and when the number of the alternative starting point keywords is multiple, displaying the alternative starting point keywords through a WEB map search engine, and filling one alternative starting point keyword determined from the displayed multiple alternative starting point keywords into a corresponding area of a starting point of route search in the WEB map search engine.
The invention also provides a system for filling keywords in route search, which comprises: the system comprises a keyword acquisition module, a keyword learning module and a keyword filling module; wherein:
the keyword acquisition module is used for acquiring starting point related information of route search;
the keyword learning module is used for selecting one or more alternative starting point keywords from all the starting point keywords in the starting point related information;
and the keyword filling module is used for filling one alternative starting point keyword determined from one or more alternative starting point keywords into a corresponding area of a starting point of route search in a WEB map search engine.
The starting point related information at least comprises a starting point keyword and accumulated use times.
The keyword acquisition module is also used for recording the relevant information of the starting point through Cookies; the Cookies comprise one or more records, and each record is used for storing a starting point keyword and the corresponding accumulated use times.
The keyword learning module is also used for determining the probability of the starting point keyword according to the accumulated use times of the starting point keyword; determining the information content of the starting point keyword according to the probability of the starting point keyword; determining the entropy of a system formed by all the starting point keywords according to the information quantity of all the starting point keywords; and selecting one or more alternative starting point keywords from all the recorded starting point keywords according to the accumulated use times of the starting point keywords, the information amount of the starting point keywords and the entropy.
The probability of the ith starting point keyword is equal to the cumulative number of use of the ith starting point keyword divided by the sum of the cumulative number of use of each starting point keyword; the i is a positive integer;
the information quantity of the starting point keyword is determined as follows: le (i) ═ log2p(i)；
Le (i) is the information content of the ith starting point keyword; the p (i) is the probability of the ith starting point keyword;
the determined entropy is:the H is the entropy; 1,2,. n; n is a positive integer.
The keyword learning module is further configured to traverse each record in the Cookies, and when the cumulative number of times of use of the start keyword corresponding to the current record is greater than a preset threshold, and when the amount of information of the start keyword corresponding to the current record is greater than a preset threshold, and the entropy is smaller than a preset threshold, take the start keyword corresponding to the current record as an alternative start keyword.
The keyword filling module is further configured to, when the candidate starting point keyword is one, directly fill the candidate starting point keyword into a corresponding area of a starting point of a route search in the WEB map search engine; or when the number of the candidate starting point keywords is multiple, displaying the candidate starting point keywords through a WEB map search engine, and filling one candidate starting point keyword determined from the displayed multiple candidate starting point keywords into a corresponding area of a starting point of route search in the WEB map search engine.
The method and the system for filling the keywords in the route search acquire the relevant information of the starting point of the route search; selecting one or more alternative starting point keywords from all the starting point keywords in the starting point related information; and filling one alternative starting point keyword determined from the one or more alternative starting point keywords into a corresponding area of the starting point of the route search in the WEB map search engine. Therefore, when a user opens the WEB map search engine, the system automatically displays the alternative starting point keywords through the WEB map search engine, the user can select the required starting point keywords from the alternative starting point keywords, and after the selected starting point keywords are filled into corresponding areas of the starting point of the route search, such as a starting point frame.
Drawings
FIG. 1 is a schematic diagram of a conventional route search;
FIG. 2 is a schematic diagram of a system for filling keywords in a route search according to the present invention;
FIG. 3 is a flowchart illustrating a method for filling keywords in a route search according to the present invention.
Detailed Description
The keywords in the present invention can be divided into starting keywords and terminal keywords. In practical applications, the user generally needs to repeatedly input the same or similar start keywords, and the end keywords are variable. Therefore, the present invention will be described by taking the filling of the starting point keyword as an example. Of course, the scheme of the invention is also suitable for the filling of the end keywords.
The invention is illustrated by the following specific examples.
As shown in fig. 2, the system for filling keywords in route search of the present invention comprises three modules: a keyword collection module 20, a keyword learning module 21, and a keyword population module 22. Wherein:
the keyword collection module 20: and collecting the starting point related information of the route search.
For a WEB map search engine, Cookies technology is adopted to collect and record relevant information of a starting point. The starting point related information at least includes: the starting point keyword (Word) and the cumulative number of uses (Count) of the starting point keyword, and further, the Time (Time) of the last use of the starting point keyword.
Cookies are data that a server temporarily stores in a client (here, a user PC), and are mainly text files in txt format. Through Cookies, the server can identify the client. When a user browses a WEB page through a client, a WEB server firstly sends a small part of data to be temporarily stored on the client to form Cookies, and then the Cookies record information or operation input by the user on the WEB page. When the user accesses the same WEB webpage again, the Web server can firstly confirm whether the corresponding Cookies are stored in the client side, if so, the Web server can judge according to the content recorded in the Cookies and push specific webpage content to the client side.
When a user searches for a route through a WEB map search engine for the first time, the WEB map server sends Cookies to the client, and the Cookies record the relevant information of the starting point at this time and every time when the user searches for the route later. It should be noted that, every time a user searches for a route using the WEB map search engine, the information related to the starting point of the cookie records is updated.
Preferably, Cookies are text files in txt format, wherein the form of the relevant information of the starting point of the record may be as follows, wherein one or more records are included, and each record is used for storing a starting point keyword and corresponding cumulative number of times of use and time of last use:
Word1，Count1，Time1；
Word2，Count2，Time2；
Word(i)，Count(i)，Time(i)；
Word(n)，Count(n)，Time(n)。
considering the actual usage scenario of the user, preferably, 0 ≦ n ≦ 100, where n also represents the number of records in Cookies. When the records in the Cookies reach 100, the system preferentially eliminates the record with the minimum Count value, and preferentially eliminates the record with the earliest Time when the Count values of a plurality of records are all minimum and equal; further, if there are multiple records with the earliest and equal times, then those multiple records are eliminated at the same Time.
Before recording the starting point related information through Cookies, the starting point related information also needs to be determined, wherein the starting point keyword can be directly input by a user or can be determined by the system without the user input, for example: and positioning the route search client, determining the geographic position of the route search client, and taking the keyword corresponding to the geographic position as a starting point keyword. The method is suitable for the mobile client, and the positioning technology adopts the existing mobile positioning technology, such as the GPS positioning technology, the WIFI positioning technology and the like.
Or determining the geographic position of the route search client according to the IP address of the route search client and the preset corresponding relation between the IP address and the geographic position, and taking the keyword corresponding to the geographic position as the starting point keyword. This approach is suitable for fixed clients.
Preferably, the keyword corresponding to the geographic location is a place name.
The keyword learning module 21: for selecting one or more alternative words from all words in the starting point related information. The specific process is as follows:
and determining the probability of Word according to the accumulated use times of Word. The formula used is as follows:
pi ═ Count (i)/Sum (Count 1+ Count2+ · Count (i) · Count (n)). That is, the probability of the ith Word is equal to the cumulative number of uses of the ith Word divided by the sum of the cumulative number of uses of each Word.
Then, determining the information content of Word according to the probability of Word; and determining the entropy of the system formed by all the words according to the information quantity of all the words. And determining the information quantity and entropy of each event according to the probability of each event by regarding each Word as one event.
Entropy here refers to the entropy of information, representing a measure of uncertainty. The definition is as follows: if there are multiple events S ═ E1,. En } in one system S, and the probability distribution P ═ P1,..,. pi.,. pn } for each event, the information content of each event itself is: le (i) ═ log2p (i) (base 2 logarithm, bit (bit)) then the average information content of the entire system S is:
n is a positive integer.
This average information amount H is the information entropy. The more ordered a system is, the more certain the message entropy is, the lower the message entropy is; conversely, the more chaotic and uncertain a system is, the higher the message entropy becomes. Therefore, the entropy of information can also be said to be a measure of the degree of uncertainty of the system.
And after the entropy is determined, selecting one or more alternative words from all the recorded words according to the accumulated use times of the words, the information amount and the entropy of the words. The specific principle is as follows:
traversing each record in Cookies, if the current record (ith record) simultaneously satisfies the following three conditions: 1. count (i) is greater than M; 2. le (i) greater than N; 3. and if the entropy is less than T, the corresponding Word is the alternative Word.
Further, the selected candidate words may be sorted and displayed to the starting point box, for example, sorted from high to low according to count (i), or sorted from high to low according to le (i).
Keyword population module 22: and the method is used for filling one alternative Word determined from one or more alternative words into a corresponding area (such as an initial point box) of an initial point of the route search in the WEB map search engine.
When the user selects the required Word from the alternative words, the following three situations exist:
1. if there is only one of the alternative words, then the keyword population module 22 directly populates the alternative Word into the start box. If the Word does not meet the user's requirements, the user can click on the start point box to manually enter the start point information.
2. If there are multiple alternative words, the keyword filling module 22 displays the alternative words through the WEB map search engine, for example, the multiple alternative words may be displayed in a drop-down list in an area near the starting point box, for example, below the starting point box. The user selects the required Word from the Word list, and the Word is filled into the starting point box by clicking, so that the user can finish filling the starting point without inputting any information. And if no Word meeting the requirements of the user exists, the user directly clicks the starting point box and manually inputs the starting point information.
3. If there is no alternative Word, the user is required to click on the start point box and manually input the start point information.
As shown in fig. 3, the method for filling keywords in route search of the present invention includes:
step 301, collecting starting point related information of route searching; wherein the starting point related information at least comprises: the starting point keyword and the accumulated use times of the starting point keyword further can include the last use time of the starting point keyword.
In this step, the start point related information is recorded by Cookies.
The Cookies comprise one or more records, each record is used for storing a starting point keyword and corresponding accumulated use times, and further, the last use time of the starting point keyword can be recorded.
Step 302, one or more alternative starting point keywords are selected from all the starting point keywords in the starting point related information.
Specifically, the probability of the starting point keyword is determined according to the cumulative number of uses of the starting point keyword: the probability of the ith starting point keyword is equal to the cumulative number of use of the ith starting point keyword divided by the sum of the cumulative number of use of each starting point keyword; i is a positive integer.
Determining the information content of the starting point keyword according to the probability of the starting point keyword: le (i) ═ log2p (i); le (i) the information amount of the ith start point keyword; p (i) is the probability of the ith start keyword.
Determining the entropy of a system consisting of all the starting point keywords according to the information quantity of all the starting point keywords, wherein H- ∑ (p (i) log2p (i); h is entropy.
According to the accumulated use times of the starting point keywords and the information amount and entropy of the starting point keywords, one or more alternative starting point keywords are selected from all the recorded starting point keywords, specifically:
traversing each record in the Cookies, and taking the starting point keyword corresponding to the current record as an alternative starting point keyword when the accumulated use times of the starting point keyword corresponding to the current record is greater than a preset threshold, the information quantity of the starting point keyword corresponding to the current record is greater than the preset threshold, and the entropy is less than the preset threshold.
Step 303, filling a candidate starting point keyword determined from the one or more candidate starting point keywords into a corresponding area of a starting point of the route search in the WEB map search engine.
When the number of the alternative starting point keywords is one, the alternative starting point keywords are directly filled in a corresponding area of a starting point of route search in a WEB map search engine; or,
and when the number of the alternative starting point keywords is multiple, displaying the alternative starting point keywords through a WEB map search engine, and filling one alternative starting point keyword determined from the displayed multiple alternative starting point keywords into a corresponding area of a starting point of route search in the WEB map search engine.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.
Claims (13)
1. A method for filling keywords in a route search, the method comprising:
collecting starting point related information of route searching; the starting point related information at least comprises a starting point keyword and accumulated use times;
selecting one or more alternative starting point keywords from all the starting point keywords in the starting point related information;
filling one alternative starting point keyword determined from one or more alternative starting point keywords into a corresponding area of a starting point of route search in a WEB map search engine;
wherein, selecting one or more alternative starting point keywords from all the starting point keywords in the starting point related information comprises:
and selecting one or more alternative starting point keywords from all the recorded starting point keywords according to the accumulated use times of the starting point keywords, the information amount of the starting point keywords and the entropy of a system consisting of all the starting point keywords.
2. The method for filling the keyword in the route search according to claim 1, wherein the collecting of the information related to the starting point of the route search comprises: recording the relevant information of the starting point through Cookies;
the Cookies comprise one or more records, and each record is used for storing a starting point keyword and the corresponding accumulated use times.
3. The method for filling in keywords in route search according to claim 2, wherein before collecting the related information of the starting point, the method further comprises: determining the starting point related information as follows:
positioning a route search client, determining the geographic position of the route search client, and taking a keyword corresponding to the geographic position as the starting point keyword;
or determining the geographic position of the route search client according to the IP address of the route search client and the preset corresponding relation between the IP address and the geographic position, and taking the keyword corresponding to the geographic position as the starting point keyword.
4. The method for filling keywords in route search according to claim 3, wherein the method further comprises:
determining the probability of the starting point keyword according to the accumulated use times of the starting point keyword;
determining the information content of the starting point keyword according to the probability of the starting point keyword;
and determining the entropy of the system formed by all the starting point keywords according to the information quantity of all the starting point keywords.
5. The method for filling keyword in route search according to claim 4, wherein determining probability of the starting point keyword according to the accumulated number of usage times of the starting point keyword comprises:
the probability of the ith starting point keyword is equal to the cumulative number of use of the ith starting point keyword divided by the sum of the cumulative number of use of each starting point keyword; the i is a positive integer;
determining the information amount of the starting point keyword according to the probability of the starting point keyword as follows: le (i) ═ log2p(i)；
Le (i) is the information content of the ith starting point keyword; the p (i) is the probability of the ith starting point keyword;
determining the entropy of a system formed by all the starting point keywords according to the information quantity of all the starting point keywords, wherein the entropy is as follows:
the H is the entropy; 1,2,. n; n is a positive integer.
6. The method for filling keywords in route search according to claim 5, wherein one or more alternative starting point keywords are selected from all the recorded starting point keywords according to the accumulated use times of the starting point keywords, the information amount of the starting point keywords and the entropy, and the method comprises the following steps:
and traversing each record in the Cookies, and taking the starting point keyword corresponding to the current record as an alternative starting point keyword when the accumulated use times of the starting point keyword corresponding to the current record is greater than a preset threshold, the information amount of the starting point keyword corresponding to the current record is less than a preset threshold, and the entropy is less than a preset threshold.
7. The method for populating a keyword in a route search according to claim 1, wherein populating a candidate starting point keyword determined from one or more candidate starting point keywords into a corresponding area of a starting point of a route search in a WEB map search engine includes:
when the number of the alternative starting point keywords is one, the alternative starting point keywords are directly filled in a corresponding area of a starting point of route search in a WEB map search engine; or,
and when the number of the alternative starting point keywords is multiple, displaying the alternative starting point keywords through a WEB map search engine, and filling one alternative starting point keyword determined from the displayed multiple alternative starting point keywords into a corresponding area of a starting point of route search in the WEB map search engine.
8. A system for filling keywords in a route search, the system comprising: the system comprises a keyword acquisition module, a keyword learning module and a keyword filling module; wherein:
the keyword acquisition module is used for acquiring starting point related information of route search; the starting point related information at least comprises a starting point keyword and accumulated use times;
the keyword learning module is used for selecting one or more alternative starting point keywords from all the starting point keywords in the starting point related information;
the keyword filling module is used for filling one alternative starting point keyword determined from one or more alternative starting point keywords into a corresponding area of a starting point of route search in a WEB map search engine;
the keyword learning module is further used for selecting one or more alternative starting point keywords from all the recorded starting point keywords according to the accumulated use times of the starting point keywords, the information amount of the starting point keywords and the entropy of a system formed by all the starting point keywords.
9. The system for filling keywords in route search according to claim 8, wherein the keyword collection module is further configured to record the information related to the starting point through Cookies; the Cookies comprise one or more records, and each record is used for storing a starting point keyword and the corresponding accumulated use times.
10. The system for filling keyword in route search according to claim 9,
the keyword learning module is also used for determining the probability of the starting point keyword according to the accumulated use times of the starting point keyword; determining the information content of the starting point keyword according to the probability of the starting point keyword; and determining the entropy of the system formed by all the starting point keywords according to the information quantity of all the starting point keywords.
11. The system for filling keyword in route search according to claim 10,
the probability of the ith starting point keyword is equal to the cumulative number of use of the ith starting point keyword divided by the sum of the cumulative number of use of each starting point keyword; the i is a positive integer;
the information quantity of the starting point keyword is determined as follows: le (i) ═ log2p(i)；
Le (i) is the information content of the ith starting point keyword; the p (i) is the probability of the ith starting point keyword;
the determined entropy is:the H is the entropy; 1,2,. n; n is a positive integer.
12. The system for filling keyword in route search according to claim 11,
the keyword learning module is further configured to traverse each record in the Cookies, and when the cumulative number of times of use of the start keyword corresponding to the current record is greater than a preset threshold, and when the information amount of the start keyword corresponding to the current record is less than a preset threshold, and the entropy is less than a preset threshold, take the start keyword corresponding to the current record as an alternative start keyword.
13. The system for filling keyword in route search according to claim 8,
the keyword filling module is further configured to, when the candidate starting point keyword is one, directly fill the candidate starting point keyword into a corresponding area of a starting point of a route search in the WEB map search engine; or when the number of the candidate starting point keywords is multiple, displaying the candidate starting point keywords through a WEB map search engine, and filling one candidate starting point keyword determined from the displayed multiple candidate starting point keywords into a corresponding area of a starting point of route search in the WEB map search engine.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210291497.8A CN103593364B (en) | 2012-08-16 | 2012-08-16 | The method and system of keyword is filled in a kind of route search |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210291497.8A CN103593364B (en) | 2012-08-16 | 2012-08-16 | The method and system of keyword is filled in a kind of route search |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103593364A CN103593364A (en) | 2014-02-19 |
| CN103593364B true CN103593364B (en) | 2017-12-12 |
Family
ID=50083513
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210291497.8A Active CN103593364B (en) | 2012-08-16 | 2012-08-16 | The method and system of keyword is filled in a kind of route search |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103593364B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107798022B (en) * | 2016-09-07 | 2023-06-16 | 北京嘀嘀无限科技发展有限公司 | Method and device for selecting order points under map search |
| WO2017157078A1 (en) | 2016-03-16 | 2017-09-21 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining location |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1801143A (en) * | 2004-12-31 | 2006-07-12 | 张箭 | Electronic map use method |
| CN1808069A (en) * | 2005-01-19 | 2006-07-26 | 乐金电子（惠州）有限公司 | Route search method |
| CN101309441A (en) * | 2007-05-16 | 2008-11-19 | 北京邮电大学 | Information search system based on user location and call center |
| CN101627384A (en) * | 2007-03-08 | 2010-01-13 | 微软公司 | From search inquiry, detect user's position, local intention and travel intent |
| CN102054362A (en) * | 2009-10-30 | 2011-05-11 | 北京四通智能交通系统集成有限公司 | Navigation information service system |
| CN102185975A (en) * | 2011-05-16 | 2011-09-14 | 中兴通讯股份有限公司 | Mobile-terminal-based bus route query method, device and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8369264B2 (en) * | 2005-10-28 | 2013-02-05 | Skyhook Wireless, Inc. | Method and system for selecting and providing a relevant subset of Wi-Fi location information to a mobile client device so the client device may estimate its position with efficient utilization of resources |
-
2012
- 2012-08-16 CN CN201210291497.8A patent/CN103593364B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1801143A (en) * | 2004-12-31 | 2006-07-12 | 张箭 | Electronic map use method |
| CN1808069A (en) * | 2005-01-19 | 2006-07-26 | 乐金电子（惠州）有限公司 | Route search method |
| CN101627384A (en) * | 2007-03-08 | 2010-01-13 | 微软公司 | From search inquiry, detect user's position, local intention and travel intent |
| CN101309441A (en) * | 2007-05-16 | 2008-11-19 | 北京邮电大学 | Information search system based on user location and call center |
| CN102054362A (en) * | 2009-10-30 | 2011-05-11 | 北京四通智能交通系统集成有限公司 | Navigation information service system |
| CN102185975A (en) * | 2011-05-16 | 2011-09-14 | 中兴通讯股份有限公司 | Mobile-terminal-based bus route query method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103593364A (en) | 2014-02-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8538973B1 (en) | Directions-based ranking of places returned by local search queries | |
| US8533187B2 (en) | Augmentation of place ranking using 3D model activity in an area | |
| US7904483B2 (en) | System and method for presenting geo-located objects | |
| CN102224498B (en) | Computer-implemented method for providing location-related content to mobile devices | |
| CN107167136B (en) | An electronic map-oriented location recommendation method and system | |
| US20170068902A1 (en) | Modeling of Geospatial Location Over Time | |
| KR20120037383A (en) | Providing search results to a computing device | |
| US9159030B1 (en) | Refining location detection from a query stream | |
| US20140358971A1 (en) | Techniques for identifying chain businesses and queries | |
| CN103927369B (en) | bus information displaying method and device | |
| CN106302829A (en) | A kind of information access method, device and server | |
| KR20100046586A (en) | Map-based web search method and apparatus | |
| US8462991B1 (en) | Using images to identify incorrect or invalid business listings | |
| US20180089241A1 (en) | Context enhanced indexing | |
| WO2013182736A1 (en) | Determination of context-aware user preferences | |
| KR100825729B1 (en) | Location-based content providing system and method | |
| US8156162B2 (en) | Storage method and search method for mark event on two-dimensional space | |
| CN112214562A (en) | Data processing method and device, electronic equipment and machine-readable storage medium | |
| CN103593364B (en) | The method and system of keyword is filled in a kind of route search | |
| US20150227583A1 (en) | Managing search results | |
| US20160104195A1 (en) | System and method of providing information based on street address | |
| US8849844B1 (en) | Image reacquisition | |
| JP2010181975A (en) | Information provision device, information provision method, information provision program and recording medium | |
| US20150261858A1 (en) | System and method of providing information based on street address | |
| JP2012108663A (en) | Information providing device and information providing program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230714 Address after: 518057 Tencent Building, No. 1 High-tech Zone, Nanshan District, Shenzhen City, Guangdong Province, 35 floors Patentee after: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. Patentee after: TENCENT CLOUD COMPUTING (BEIJING) Co.,Ltd. Address before: 2, 518044, East 403 room, SEG science and Technology Park, Zhenxing Road, Shenzhen, Guangdong, Futian District Patentee before: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. |
|
| TR01 | Transfer of patent right |