CN106055635B - Address information lookup method and device - Google Patents
Address information lookup method and device Download PDFInfo
- Publication number
- CN106055635B CN106055635B CN201610370138.XA CN201610370138A CN106055635B CN 106055635 B CN106055635 B CN 106055635B CN 201610370138 A CN201610370138 A CN 201610370138A CN 106055635 B CN106055635 B CN 106055635B
- Authority
- CN
- China
- Prior art keywords
- node
- address
- information
- digraph
- scoring
- 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; CALCULATING OR 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
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)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of address information lookup method and devices.Address information lookup method of the invention includes: step 1, receives search request, the text information of address is carried in the request, executes step 2；Step 2, it is based on address digraph, the corresponding node in the address is searched in the way of structuring, executes step 3；Step 3, the scoring of the node is calculated；If the scoring of the node executes step 4 lower than the threshold value of setting；If the scoring of the node executes step 6 not less than the threshold value of setting；Step 4, the corresponding node in the address is searched using search engine technique, step 5 executes；Step 5, the corresponding address information of the node found in step 4 is returned into user；Step 6, the corresponding address information of the node found in step 2 is returned into user.Address information lookup method of the invention and device combine chart database inquiring technology and search engine technique, improve the precision of address search.
Description
Technical field
The present invention relates to a kind of address information lookup method and devices.
Background technique
The postal address in the same place, different user may provide different descriptions.
By taking " the software mansion of Shenzhen City, Guangdong Province Nanshan District High-Tech Road Zhong Qu 9 " this address as an example, user's input
Address may be " Nanshan District, Shenzhen City High-Tech Road software mansion ", it may be possible to " Nanshan District, Shenzhen City High-Tech Road with
The software mansion of three intersections in science and technology ", in some instances it may even be possible to be " Shenzhen software mansion ".Backstage is needed according to the postal received
Political affairs address information carries out accurately Address Recognition.
Prior art, such as Amap, Baidu map etc. are that Address Recognition, place are carried out using search engine technique
Reason speed is slower, and operand is larger, it is difficult to guarantee positioning accuracy.
Summary of the invention
For the defects in the prior art, the present invention provides address information lookup method and device, combines chart database
Inquiring technology and search engine technique improve the precision of address search.
In a first aspect, a kind of address information lookup method provided by the invention, comprising: step S1 receives search request, institute
The text information for carrying address in request is stated, step S2 is executed；Step S2 is based on address digraph, in the way of structuring
The corresponding node in the address is searched, step S3 is executed；Step S3 calculates the scoring of the node；If the scoring of the node
Lower than the threshold value of setting, step S4 is executed；If the scoring of the node executes step S6 not less than the threshold value of setting；Step S4,
The corresponding node in the address is searched using search engine technique, step S5 is executed；Step S5, the section that will be found in step S4
The corresponding address information of point returns to user；Step S6, the node found in step S2 is corresponding
OF713-16P101639 address information returns to user.
Address information lookup method provided by the invention utilizes diagram data in conjunction with the data storage method of address digraph
Library inquiry technology and search engine technique, improve the positioning accuracy of address search, while improving search efficiency.
Optionally, described to be based on address digraph, the corresponding node in the address is searched in the way of structuring, is wrapped
It includes: cutting being carried out to the text information and obtains multiple participles；It adds and marks for each participle, it is described to be noted for distinguishing address
Administrative region rank；Each participle of the text information is defined as a node, and according to the corresponding administrative area of mark
Domain level order defines directed edge, constitutes address fragment；The information of the node includes the mark of the title of the node, the node
With the description information of more than father node of the node each node, the corresponding participle of the described entitled node；It respectively will describedly
Each node in the segment of location is matched with the node in the digraph of address, and the node of successful match is hit；According to branch
With relationship, the node of matched minimum particle size in the digraph of address is determined, as the node found.
Optionally, described mark for the addition of each participle includes: according to the information pre-saved in knowledge base, is each point
Word addition mark；If can not be participle addition mark according to the information in knowledge base, be added in such a way that Feature Words are guessed
Mark.
Optionally, this method further include: it is described respectively by the address fragment each node and address digraph in
Node matched, the node of successful match is hit, further includes: according to the mark of each node in the address fragment
Note, selection carry out hit according to the father node of the node or are directly hit with the node.
Optionally, if the corresponding informance that the scoring for calculating the node includes: the node in the digraph of address is returned
Reuse family, then the node by lookup number adds 1；If the address information for returning to user is confirmed by the user, the address information pair
The node answered is identified that number adds 1；It is described to be identified that number, by lookup number, obtains the first power of the node divided by described
Weight；Using the hit rate of the context of the node as the second weight；According to the first weight and the second weight of the node, obtain
To the scoring of the node.
Optionally, between step 3 and step 6 further include: according to scoring, be ranked up to the node found.
Optionally, this method further include: if meeting condition 1 or condition 2, obtain in predetermined amount of time in search request not
The corresponding address fragment of the node of hit, and address digraph is updated according to the address fragment of acquisition；The condition 1 is pre- timing
Between the node of miss is searched in section number reach given threshold, and the existing node in the node and address digraph is not
Conflict；The condition 2 is that the sequence in predetermined amount of time in the node of all miss is forward, and the node and address are oriented
Existing node in figure does not conflict.
Second aspect, a kind of address information lookup device provided by the invention, comprising: receiving module is searched for receiving
It requests, the text information of address is carried in the request；Address search module, for being based on address digraph, according to structuring
Mode search the corresponding node in the address；Grading module is calculated, for calculating the scoring of the node；Search engine mould
Block, if the scoring for the node searches the corresponding node in the address using search engine technique lower than the threshold value of setting；
First address return module, the corresponding address information of node for finding described search engine modules return to user；The
Double-address return module, if the scoring for the node finds the address search module not less than the threshold value of setting
The corresponding address information of node return to user.
Optionally, the address search module is specifically used for: carrying out cutting to the text information and obtains multiple participles；For
Each participle addition mark, the administrative region rank for being noted for distinguishing address；By each participle of the text information
It is defined as a node, and defines directed edge according to corresponding administrative region level order is marked, constitutes address fragment；The section
The information of point includes the description information of each node of the father node of the title of the node, the mark of the node and the node or more, institute
State the corresponding participle of the entitled node；Respectively by the address fragment each node and address digraph in node into
The node of row matching, successful match is hit；According to dominance relation, the section of matched minimum particle size in the digraph of address is determined
Point, as the node found.
Optionally, described mark for the addition of each participle includes: according to the information pre-saved in knowledge base, is each point
Word addition mark；If can not be participle addition mark according to the information in knowledge base, be added in such a way that Feature Words are guessed
Mark.
Address information provided by the invention searches device and utilizes diagram data in conjunction with the data storage method of address digraph
Library inquiry technology and search engine technique, improve the positioning accuracy of address search, while improving search efficiency.
Detailed description of the invention
Fig. 1 is a kind of flow chart of address information lookup method provided by the embodiment of the present invention；
Fig. 2 is the flow chart of the address lookup method based on address digraph；
Fig. 3 is a kind of structural block diagram of address information lookup device provided by the embodiment of the present invention；
Fig. 4 is address fragment schematic diagram；
Fig. 5 is the schematic diagram of address digraph.
Specific embodiment
It is described in detail below in conjunction with embodiment of the attached drawing to technical solution of the present invention.Following embodiment is only used for
Clearly illustrate technical solution of the present invention, therefore be intended only as example, and cannot be used as a limitation and limit protection of the invention
Range.
It should be noted that unless otherwise indicated, technical term or scientific term used in this application should be this hair
The ordinary meaning that bright one of ordinary skill in the art are understood.
As shown in Figure 1, address information lookup method provided in an embodiment of the present invention, comprising:
Step S1 receives search request, the text information of address is carried in request, executes step S2.
Step S2 is based on address digraph, and the corresponding node in address is searched in the way of structuring, executes step S3.
Wherein, address digraph is the graph data comprising address information, as shown in Figure 5.
Step S3, the scoring of calculate node；If the scoring of node executes step S4 lower than the threshold value of setting；If node
Scoring executes step S6 not less than the threshold value of setting.
Step S4 searches the corresponding node in address using search engine technique, and step S5 is executed.
The corresponding address information of the node found in step S4 is returned to user by step S5.
The corresponding address information of the node found in step S2 is returned to user by step S6.
Address information lookup method provided by the invention utilizes diagram data in conjunction with the data storage method of address digraph
Library inquiry technology and search engine technique, improve the positioning accuracy of address search, while improving search efficiency.
As shown in Fig. 2, being specifically included the embodiment of the invention provides the preferred embodiment of step S2:
Step S201 carries out cutting to text information and obtains multiple participles.
To text information cutting, cutting is mainly carried out according to the administrative region rank rank of place name, for example, " Shenzhen
Nanshan District, software mansion, High-Tech Road " obtains following participle: Shenzhen, Nanshan District, High-Tech Road, software after cutting
Mansion.The cutting of step S201 can be realized using existing any participle technique.
Step S202, each participle addition mark obtained for cutting.
Wherein, mark is mainly used for distinguishing the administrative region rank of address, for example, Shenzhen is labeled as " city ", South Mountain
Area is labeled as in " area ", and High-Tech Road is labeled as in " street ", and software mansion is labeled as " office building ".It is, of course, also possible to
Other marks are added, for example, doorplate relationship, position relation etc., the present invention is without limitation.Step S202 can use existing skill
Art carries out participle mark.
Each participle of institute's text information is defined as a node by step S203, and according to the corresponding administrative area of mark
Domain level order defines directed edge, constitutes address fragment.
As shown in figure 4, address fragment one is the ground to be built according to text information " Nanshan District, Shenzhen City software mansion "
Location segment, Shenzhen therein, Nanshan District, software mansion are all nodes, and the line between Shenzhen and Nanshan District, which is one, to be had
Xiang Bian, the line between Nanshan District and software mansion are a directed edge.
Wherein, the information that node includes includes: the father node of the title of the node, the mark of the node and the node or more
The description information of each node.The corresponding participle of the entitled node of node.The description information of node is corresponding to the node
The description for meeting specification of address, by taking the address base in Fig. 5 as an example, the description information of " software mansion " is " Nanshan District, Shenzhen City
High-Tech Road software mansion ", the description information of " Nanshan District " are " Nanshan District, Shenzhen City ".
In real life, one place may have multiple and different titles, in order to avoid same place correspond to it is multiple
The information of the problem of node, node further include the Alias information of the nodename, in this way regardless of how many difference of one place
Title, it all only corresponds to a node in address base, can effectively reduce number of nodes in this way, to reduce final establish
Address base volume.
Step S204 respectively matches each node in address fragment with the node in the digraph of address, matching
Successful node is hit.
Step S205 determines the node of matched minimum particle size in the digraph of address according to dominance relation, as finding
Node.
Wherein, if a node sin prole superstite node being hit is hit, which is exactly the node of minimum particle size.Example
Such as, it is assumed that the address of lookup is " Nanshan District, Shenzhen City High-Tech Road ", and the point being hit in Fig. 5 is " Shenzhen " " South Mountain
The descendant nodes in area " " High-Tech Road ", " Shenzhen " and " Nanshan District " are hit, so " Shenzhen " and " Nanshan District " is all
It is not the node of minimum particle size, the descendant nodes of " High-Tech Road " are not hit, and " High-Tech Road " is exactly minimum particle size
Node.
Make following citing for step S204 and S205.
Assuming that the address searched is " Nanshan District, Shenzhen City software mansion ", the node after cutting includes " Shenzhen ", " South Mountain
Area " and " software mansion "；In digraph as shown in Figure 5, it is matched to and " Shenzhen ", " Nanshan District " and " software mansion "
The identical node of title, i.e., the point hit in digraph are " Shenzhen ", " Nanshan District " and " software mansion "；As shown in Figure 5,
After obtaining " software mansion " this point, so that it may sufficient address is obtained, so node " Shenzhen " and " Nanshan District " before
It is all dominated, " software mansion " is exactly the node of the minimum particle size finally obtained.
The embodiment of the invention provides a kind of preferred embodiment of step S202, specific implementations are as follows: according in knowledge base
The information pre-saved, for each participle addition mark；If can not be participle addition mark according to the information in knowledge base, lead to
The mode for crossing Feature Words conjecture adds mark.
Wherein, Feature Words can be " mansion " " building " " cell " " factory " etc..It is carried out in such a way that Feature Words are guessed
Mark, can be implemented by using the prior art.
The embodiment of the present invention further additionally provides the preferred embodiment of step S204, specifically includes: according to the address slice
The mark of each node in section, selection carry out hit according to the father node of the node or are directly hit with the node.
For number, Lou Hao, room number etc., in matching, can first hit this since the node of same names is more
The father node of a little nodes, corresponding number, Lou Hao, room number etc. are then searched under father node, processing can be improved in this way
Efficiency.For example when searching " building of Nanshan District, Shenzhen City software mansion the 9th ", " software mansion " can be first hit, then " software is big
" No. 9 building " corresponding node is found in the descendant nodes in tall building ", the range searched in this way can greatly reduce.
Superior node is all nodes before some node, and father node is the superior node adjacent with certain node, such as " deep
Zhen Shi " is the father node of " Nanshan District ", and " Nanshan District " is the father node of " software mansion ", and " Shenzhen " and " Nanshan District " is all
The superior node of " software mansion "；Descendant nodes are all nodes after some node, such as " Nanshan District " and " software is big
Tall building " is all the descendant nodes of " Shenzhen ".
When the address information that digraph includes when address is enough, the possibility for being matched to multiple nodes is had, to reduce ground
The error rate of location inquiry, the embodiment of the invention provides a kind of preferred embodiments of step S3: if node in the digraph of address
Corresponding informance is returned user, then the node by lookup number adds 1；If the address information for returning to user is confirmed by the user,
The corresponding node of the address information is identified that number adds 1；The node is identified that number, by lookup number, is obtained divided by described
First weight of the node；Using the hit rate of the context of node as the second weight；According to the first weight of node and second
Weight obtains the scoring of node.
Wherein, the hit rate of context is the probability that is hit of node of the superior and the subordinate for the node being matched to.Or to look into
It looks for for " Nanshan District, Shenzhen City software mansion ", it is assumed that there are one software mansions for Shenzhen in Futian District, then in hit
In the process, " Shenzhen ", " Nanshan District " " software mansion " (Nanshan District), " software mansion " (Futian District) these nodes can be hit；
The total quantity for searching node is 3, and " Nanshan District " above of the software mansion of Nanshan District and " Shenzhen " are all hit, " software mansion "
(Nanshan District) context hit quantity is 3, with context hit quantity divided by the total quantity for searching node, obtains " software mansion "
The hit rate of (Nanshan District) is 1；And only " Shenzhen " hit above of the software mansion of Futian District, " software mansion " (Feitian
Area) context hit quantity be 2, then hit rate be 2/3.
Wherein, score it is higher, that is, indicate the corresponding address of the node be the address that user requires to look up probability it is higher.
The embodiment of the present invention is between step 3 and step 6 further include: according to scoring, is ranked up to the node found.
Wherein, the node found is possible to more than one, is carried out according to the scoring of node to all nodes found
Sequence is scored higher, is ranked more forward.When lookup result is returned to user, also client can be presented to according to sequence.
Address information lookup method provided in an embodiment of the present invention can accurately in hiting data library node, improve
The accuracy of lookup.But during address search, inevitably always has some addresses and do not deposited in the digraph of address
It is being impossible to find these addresses by address digraph at this time.
In order to solve drawbacks described above, address information lookup method provided in an embodiment of the present invention further includes database update step
Suddenly, it is realized especially by following manner: if meeting condition 1 or condition 2, obtaining in predetermined amount of time miss in search request
The corresponding address fragment of node, and according to the address fragment of acquisition update address digraph；Condition 1 be predetermined amount of time in not
The number that the node of hit is searched reaches given threshold, and the node does not conflict with the existing node in the digraph of address；Item
Part 2 is forward for the sequence in predetermined amount of time in the node of all miss, and existing in the node and address digraph
Node does not conflict.
As shown in figure 3, being based on inventive concept identical with address above mentioned information searching method, the present invention provides a kind ofly
Location information searching device, comprising: receiving module 101 carries the text information of address for receiving search request in request；Ground
Location searching module 102 searches the corresponding node in address for being based on address digraph in the way of structuring；Calculate scoring
Module 103, the scoring for calculate node；Search engine module 104, if the scoring for node is adopted lower than the threshold value of setting
The corresponding node in address is searched with search engine technique；First address return module 105, for looking into search engine module 104
The corresponding address information of the node found returns to user；Second address return module 106 is set if the scoring for node is not less than
Fixed threshold value, the corresponding address information of the node that address search module 102 is found return to user.
Address information provided by the invention searches device and utilizes diagram data in conjunction with the data storage method of address digraph
Library inquiry technology and search engine technique, improve the positioning accuracy of address search, while improving search efficiency.
Wherein, address search module 102 is specifically used for: carrying out cutting to text information and obtains multiple participles；It is each point
Word addition mark is noted for distinguishing the administrative region rank of address；Each participle of text information is defined as a node,
And directed edge is defined according to corresponding administrative region level order is marked, constitute address fragment；The information of node includes the node
Title, the description information of more than mark of the node and the father node of the node each node, entitled node pair of node
The participle answered；Each node in address fragment is matched with the node in the digraph of address respectively, the section of successful match
Point is hit；According to dominance relation, the node of matched minimum particle size in the digraph of address is determined, as the section found
Point.
It wherein, include: to be added according to the information pre-saved in knowledge base for each participle for each participle addition mark
Mark；If can not be participle addition mark according to the information in knowledge base, mark be added in such a way that Feature Words are guessed.
Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Pipe present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: its according to
So be possible to modify the technical solutions described in the foregoing embodiments, or to some or all of the technical features into
Row equivalent replacement；And these are modified or replaceed, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme should all cover within the scope of the claims and the description of the invention.
Claims (7)
1. a kind of address information lookup method characterized by comprising
Step S1 receives search request, the text information of address is carried in the request, executes step S2；
Step S2 is based on address digraph, and the corresponding node in the address is searched in the way of structuring, executes step S3；
Step S3 calculates the scoring of the node；If the scoring of the node executes step S4 lower than the threshold value of setting；If institute
Threshold value of the scoring not less than setting for stating node, executes step S6；
Step S4 searches the corresponding node in the address using search engine technique, and step S5 is executed；
The corresponding address information of the node found in step S4 is returned to user by step S5；
The corresponding address information of the node found in step S2 is returned to user by step S6；
It is described to be based on address digraph, the corresponding node in the address is searched in the way of structuring, comprising:
Cutting is carried out to the text information and obtains multiple participles；
It adds and marks for each participle, the administrative region rank for being noted for distinguishing address；
Each participle of the text information is defined as a node, and fixed according to corresponding administrative region level order is marked
Adopted directed edge constitutes address fragment；The information of the node includes the father of the title of the node, the mark of the node and the node
The more than node description information of each node, the corresponding participle of the described entitled node；
Each node in the address fragment is matched with the node in the digraph of address respectively, the node of successful match
It is hit；
According to dominance relation, the node of matched minimum particle size in the digraph of address is determined, as the node found；
The scoring for calculating the node includes:
If the corresponding informance of the node in the digraph of address is returned user, which adds 1 by lookup number；
If the address information for returning to user is confirmed by the user, the corresponding node of the address information is identified that number adds 1；
It is described to be identified that number, by lookup number, obtains the first weight of the node divided by described；
Using the hit rate of the context of the node as the second weight；
According to the first weight and the second weight of the node, the scoring of the node is obtained.
2. the method according to claim 1, wherein described include: for each participle addition mark
According to the information pre-saved in knowledge base, for each participle addition mark；
If can not be participle addition mark according to the information in knowledge base, mark be added in such a way that Feature Words are guessed.
3. the method according to claim 1, wherein it is described respectively by the address fragment each node with
Node in the digraph of address is matched, and the node of successful match is hit, further includes: according in the address fragment
The mark of each node, selection carry out hit according to the father node of the node or are directly hit with the node.
4. the method according to claim 1, wherein between step 3 and step 6 further include: right according to scoring
The node found is ranked up.
5. the method according to claim 1, wherein further include:
If meeting condition 1 or condition 2, the corresponding address slice of node of miss in search request in predetermined amount of time is obtained
Section, and address digraph is updated according to the address fragment of acquisition；
The condition 1 is that the number that the node of miss in predetermined amount of time is searched reaches given threshold, and the node and ground
Existing node in the digraph of location does not conflict；
The condition 2 is forward for the marking and queuing in predetermined amount of time in the node of all miss, and the node and address
Existing node in digraph does not conflict.
6. a kind of address information searches device characterized by comprising
Receiving module carries the text information of address for receiving search request in the request；
Address search module searches the corresponding node in the address for being based on address digraph in the way of structuring；
Grading module is calculated, for calculating the scoring of the node；
Search engine module, if for the node scoring lower than setting threshold value, searched using search engine technique described in
The corresponding node in address；
First address return module, the corresponding address information of node for finding described search engine modules, which returns, to be used
Family；
Second address return module, if being not less than the threshold value of setting for the scoring of the node, by the address search module
The corresponding address information of the node found returns to user；
The address search module is specifically used for:
Cutting is carried out to the text information and obtains multiple participles；
It adds and marks for each participle, the administrative region rank for being noted for distinguishing address；
Each participle of the text information is defined as a node, and fixed according to corresponding administrative region level order is marked
Adopted directed edge constitutes address fragment；The information of the node includes the father of the title of the node, the mark of the node and the node
The more than node description information of each node, the corresponding participle of the described entitled node；
Each node in the address fragment is matched with the node in the digraph of address respectively, the node of successful match
It is hit；
According to dominance relation, the node of matched minimum particle size in the digraph of address is determined, as the node found；
The scoring for calculating the node includes:
If the corresponding informance of the node in the digraph of address is returned user, which adds 1 by lookup number；
If the address information for returning to user is confirmed by the user, the corresponding node of the address information is identified that number adds 1；
It is described to be identified that number, by lookup number, obtains the first weight of the node divided by described；
Using the hit rate of the context of the node as the second weight；
According to the first weight and the second weight of the node, the scoring of the node is obtained.
7. device according to claim 6, which is characterized in that described to include: for each participle addition mark
According to the information pre-saved in knowledge base, for each participle addition mark；
If can not be participle addition mark according to the information in knowledge base, mark be added in such a way that Feature Words are guessed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610370138.XA CN106055635B (en) | 2016-05-30 | 2016-05-30 | Address information lookup method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610370138.XA CN106055635B (en) | 2016-05-30 | 2016-05-30 | Address information lookup method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106055635A CN106055635A (en) | 2016-10-26 |
| CN106055635B true CN106055635B (en) | 2019-11-19 |
Family
ID=57172848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610370138.XA Active CN106055635B (en) | 2016-05-30 | 2016-05-30 | Address information lookup method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106055635B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101719128A (en) * | 2009-12-31 | 2010-06-02 | 浙江工业大学 | Fuzzy matching-based Chinese geo-code determination method |
| CN104462059A (en) * | 2014-12-01 | 2015-03-25 | 银联智惠信息服务（上海）有限公司 | Commercial tenant address information recognition method and device |
| CN104679850A (en) * | 2015-02-13 | 2015-06-03 | 深圳市华傲数据技术有限公司 | Address structuring method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120260205A1 (en) * | 2011-04-07 | 2012-10-11 | Grigore Rusu | System and method for event tracking across plural contact mediums |
-
2016
- 2016-05-30 CN CN201610370138.XA patent/CN106055635B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101719128A (en) * | 2009-12-31 | 2010-06-02 | 浙江工业大学 | Fuzzy matching-based Chinese geo-code determination method |
| CN104462059A (en) * | 2014-12-01 | 2015-03-25 | 银联智惠信息服务（上海）有限公司 | Commercial tenant address information recognition method and device |
| CN104679850A (en) * | 2015-02-13 | 2015-06-03 | 深圳市华傲数据技术有限公司 | Address structuring method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106055635A (en) | 2016-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109145169B (en) | Address matching method based on statistical word segmentation | |
| CN109299110B (en) | Data query method and device, storage medium and electronic equipment | |
| US9652474B2 (en) | Providing regional content by matching geographical properties | |
| USRE44876E1 (en) | Proximity search methods using tiles to represent geographical zones | |
| US8538973B1 (en) | Directions-based ranking of places returned by local search queries | |
| CN103605752A (en) | Address matching method based on semantic recognition | |
| WO2015027836A1 (en) | Method and system for place name entity recognition | |
| CN101313300A (en) | Local search | |
| CN107203526B (en) | Query string semantic demand analysis method and device | |
| CN102033947B (en) | Region recognizing device and method based on retrieval word | |
| CN102483748A (en) | Query parsing for map search | |
| CN106874384A (en) | A kind of isomery address standard handovers and matching process | |
| CN107167136A (en) | Recommend method and system in a kind of position towards electronic map | |
| US20170308560A1 (en) | Location Searching with Category Indices | |
| CN106874287A (en) | A kind of processing method and processing device of point of interest POI geocodings | |
| CN104679801A (en) | Point of interest searching method and point of interest searching device | |
| CN101270992A (en) | Search device and search method of geographical coordinates | |
| CN110019617B (en) | Method and device for determining address identifier, storage medium and electronic device | |
| CN107633068B (en) | Rapid indexing method and system based on position top-k keyword query under sliding window | |
| CN106777118B (en) | A kind of quick abstracting method of geographical vocabulary based on fuzzy dictionary tree | |
| CN106021556A (en) | Address information processing method and device | |
| CN107908627A (en) | A kind of multilingual map POI search systems | |
| CN106599303A (en) | Address matching method and system | |
| CN112256821B (en) | Chinese address completion method, device, equipment and storage medium | |
| CN106682175A (en) | Method and system for matching address |
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 | ||
| CP02 | Change in the address of a patent holder |
Address after: 518000 2203/2204, Building 1, Huide Building, Beizhan Community, Minzhi Street, Longhua District, Shenzhen, Guangdong Patentee after: SHENZHEN AUDAQUE DATA TECHNOLOGY Ltd. Address before: 518000 units J and K, 12 / F, block B, building 7, Baoneng Science Park, Qinghu Industrial Zone, Qingxiang Road, Longhua New District, Shenzhen City, Guangdong Province Patentee before: SHENZHEN AUDAQUE DATA TECHNOLOGY Ltd. |
|
| CP02 | Change in the address of a patent holder |