Standard address determination method and device, equipment and storage medium

Abstract

The embodiment of the invention discloses a standard address determination method and device, equipment and a storage medium, and relates to the technical field of computers, the method comprises the following steps: determining address elements of multiple levels corresponding to a to-be-matched address and a central address element, and determining a target node element in a standard address tree; determining a next node element matched with the next-level address element according to the target node element, and determining a next target node element in the next node element; updating the target node element based on the next target node element, returning to execute the step of determining the next node element according to the target node element until the level of the next-level address element is lower than that of the central address element, and determining the next target node element as an end point address element; and determining a standard address to be matched corresponding to each end point address element, and determining a standard address corresponding to the address to be matched in the standard address to be matched. According to the technical scheme, the standard address matching efficiency and precision are improved.

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of computer technology, and in particular to a method, apparatus, device and storage medium for determining a standard address. Background Art

[0002] Standard address matching can be used to determine the standard address of the address to be matched, providing a data basis for services such as address query, express delivery, and itinerary flow tracking.

[0003] In the prior art, the address elements corresponding to the address to be matched are first determined, and then the address elements are sorted according to the hierarchical constraints of the address. The sorted address elements are stored based on a multi-branch tree, and address matching is performed in the multi-branch tree by combining fuzzy matching and hierarchical backtracking to determine the standard address corresponding to the address to be matched.

[0004] In the process of implementing the present invention, the inventors found that there are at least the following technical problems in the prior art:

[0005] When the address to be matched has problems such as address aliases and / or address element confirmation, the accuracy of standard address matching is low. Summary of the invention

[0006] The present invention provides a standard address determination method, device, equipment and storage medium to improve the standard address matching accuracy.

[0007] In a first aspect, an embodiment of the present invention provides a method for determining a standard address, including:

[0008] Determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree;

[0009] Determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element in the next node element;

[0010] Based on the next target node element, the target node element is updated, and the next node element that matches the next level address element of the address to be matched is determined according to the target node element in the standard address tree, until the level of the next level address element is lower than the level of the central address element, and the next target node element is determined as the end point address element;

[0011] The to-be-matched standard address corresponding to each of the destination address elements is determined in the standard address tree, and the standard address corresponding to the to-be-matched address is determined in the to-be-matched standard addresses.

[0012] In a second aspect, an embodiment of the present invention further provides a standard address determination device, including:

[0013] A first determination module is used to determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree;

[0014] A second determination module, configured to determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element in the next node element;

[0015] An updating module, configured to update the target node element based on the next target node element, return to execute the next node element that matches the next level address element of the address to be matched in the standard address tree according to the target node element, until the level of the next level address element is lower than the level of the central address element, and determine the next target node element as the end point address element;

[0016] The execution module is used to determine the to-be-matched standard address corresponding to each of the end point address elements in the standard address tree, and determine the standard address corresponding to the to-be-matched address in the to-be-matched standard addresses.

[0017] In a third aspect, an embodiment of the present invention further provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the standard address determination method as described in any one of the first aspects is implemented.

[0018] In a fourth aspect, an embodiment of the present invention further provides a storage medium comprising computer executable instructions, wherein the computer executable instructions, when executed by a computer processor, are used to execute the standard address determination method as described in any one of the first aspects.

[0019] The embodiments of the above invention have the following advantages or beneficial effects:

[0020] An embodiment of the present invention provides a method for determining a standard address, comprising: determining multiple levels of address elements and a central address element corresponding to an address to be matched, determining a target node element in the highest node element that matches the highest level address element of the address to be matched in a standard address tree; determining a next node element that matches the next level address element of the address to be matched in the standard address tree according to the target node element, and determining a next target node element in the next node element; updating the target node element based on the next target node element, returning to execute the next node element that matches the next level address element of the address to be matched in the standard address tree according to the target node element, until the level of the next level address element is lower than the level of the central address element, and determining the next target node element as the terminal address element; determining the standard address to be matched corresponding to each of the terminal address elements in the standard address tree, and determining the standard address corresponding to the address to be matched in the standard address to be matched. The above technical scheme, first, performs address segmentation on the address to be matched to obtain the address elements and the central address element corresponding to the address elements to be matched; secondly, determines the highest node element matching the highest level address element of the address to be matched in the standard address tree; determines the target node element in the highest node element according to the similarity between each highest node element and the highest level address element of the address to be matched, so as to determine the target node element that better matches the highest level address element of the address to be matched; then, determines the next node element matching the next level address element of the address to be matched in the standard address tree according to the target node element, and determines the next target node element in the next node element; after updating the target node element based on the next target node element, continues to determine the next target node element until the level of the next level address element is lower than the level of the central address element; at this time, the next target node element can be determined as the terminal address element; determines the standard address to be matched corresponding to each terminal address element in the standard address tree; determines the standard address to be matched with the highest similarity to the address to be matched as the standard address corresponding to the address to be matched, thereby avoiding a large amount of calculation while achieving the standard address matching of the address to be matched, and improving the accuracy of the standard address matching. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 A flow chart of a method for determining a standard address provided by an embodiment of the present invention;

[0022] Figure 2 A schematic diagram of a standard address tree provided by an embodiment of the present invention;

[0023] Figure 3 A flowchart of another standard address determination method provided by an embodiment of the present invention;

[0024] Figure 4A flowchart of another method for determining a standard address provided by an embodiment of the present invention;

[0025] Figure 5 A schematic diagram of the structure of a standard address determination device provided by an embodiment of the present invention;

[0026] Figure 6 A schematic diagram of the structure of a computer device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0027] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

[0028] It should be mentioned before discussing exemplary embodiments in more detail that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe various operations (or steps) as sequential processes, many operations therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of various operations can be rearranged. The process can be terminated when its operation is completed, but can also have additional steps not included in the accompanying drawings. The process can correspond to methods, functions, procedures, subroutines, subprograms, etc. In addition, the embodiments in the present invention and the features in the embodiments can be combined with each other without conflict.

[0029] Standard address matching can be widely used in a variety of business scenarios, such as address standardization, address query, and itinerary flow adjustment. Address matching can determine the standard address corresponding to the address to be matched by marking the address to be matched. In the prior art, on the one hand, a matching method based on full-text search can be used to traverse all address elements in all address libraries, determine their similarity with the address to be matched, and determine the standard address corresponding to the address to be matched according to the similarity calculation result. This matching method has a large amount of calculation and consumes a lot of time, resulting in low efficiency of standard address matching. On the other hand, a matching method based on a multi-branch tree can be used to determine the address elements of the address to be matched, sort the address elements according to the hierarchical constraints of the address, store the sorted address elements based on the multi-branch tree, perform address matching in the multi-branch tree, and determine the standard address corresponding to the address to be matched. Although this matching method can solve the problems of large amount of calculation and high time consumption of address matching, when the address to be matched has problems such as address ambiguity, address alias, address missing, space constraint error, space constraint redundancy, and non-unique space constraint, address matching in the multi-branch tree is prone to node search failure, resulting in address matching failure and reducing the accuracy of standard address matching.

[0030] Therefore, the present application proposes a standard address determination method to effectively improve the efficiency and accuracy of standard address matching.

[0031] The standard address determination method proposed in this application will be described in detail below with reference to diagrams and embodiments.

[0032] Figure 1 The flowchart of a standard address determination method provided by an embodiment of the present invention is applicable to situations where the standard address matching accuracy needs to be improved. The method can be executed by a standard address determination device, which can be implemented by software and / or hardware. Figure 1 The method specifically comprises the following steps:

[0033] Step 110: determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree.

[0034] Figure 2 A schematic diagram of a standard address tree provided by an embodiment of the present invention, such as Figure 2 As shown in the figure, the standard address is composed of address elements at different levels, and there are spatial constraints between each address element. Based on the spatial constraints of the standard addresses stored in the standard address library, a standard address tree can be constructed. The nodes in the standard address tree correspond to geographic entities in the actual geographic space, and the nodes store the standard names, historical names, and aliases of the node elements.

[0035] Information points (POIs) with the same element name, similar latitude and longitude addresses, and belonging to the same street or community at the same address level will be merged. Therefore, POIs may have multiple parent nodes. For example, a community or university may have multiple exits, each belonging to a different road. Due to data coverage and user usage habits of addresses, some standard addresses may have missing elements; for example, when the POI is unique in the entire area, some information can be omitted. For example, "Shijian Town Police Station, Wuwei City, Wuhu City, Anhui Province", community and road information are omitted; "Telecom Building, Beijing West Road, Jinghu District, Wuhu City, Anhui Province", street and community information are omitted.

[0036] Specifically, the address to be matched can be first segmented to determine multiple levels of address elements corresponding to the address to be matched. Specifically, the address to be matched can be processed based on a text analysis algorithm to obtain multiple levels of address elements corresponding to the address to be matched. Of course, the address element or address element combination representing the destination or point of interest can also be determined as the central address element of the address to be matched, and the central address element represents the most noteworthy address element in the address to be matched.

[0037] Furthermore, the address elements of each level corresponding to the address to be matched can be matched from high level to low level in the standard address tree. The highest node element that matches the highest level address element of the address to be matched is determined in the standard address tree. Specifically, starting from the root node element, the node elements of each level in the standard address tree are placed in the retention space in sequence. If there is a node element with a level higher than the level of the highest level address element in the retention space, the node element is deleted from the retention space, and the child node elements of the node element in the standard address tree are placed in the retention space until the level of all node elements in the retention space is not higher than the level of the highest level address element. At this time, all node elements in the retention space can be determined as the highest node elements that match the highest level address element of the address to be matched in the standard address tree. The address loss degree of each highest node element is determined based on the similarity between each highest node element and the highest level address element of the address to be matched, and the highest node element whose address loss degree meets the preset numerical conditions is determined as the target node element.

[0038] In an embodiment of the present invention, after address segmentation is performed on the address to be matched to obtain multiple levels of address elements and a central address element corresponding to the address elements to be matched, the highest node element that matches the highest level address element of the address to be matched can be determined in the standard address tree, and then the target node element that better matches the highest level address element of the address to be matched can be determined in the highest node elements based on the similarity between each highest node element and the highest level address element of the address to be matched.

[0039] Step 120: Determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element among the next node elements.

[0040] The target node element that better matches the highest level address element of the address to be matched is stored in the reserved space. If the level of the target node element is consistent with the level of the next level address element of the address to be matched, the target node element is determined as the next node element that matches the next level address element of the address to be matched. If the level of the target node element is higher than the level of the next level address element of the address to be matched, the child node element of the target node element in the standard address tree is determined as the next node element that matches the next level address element of the address to be matched, and the child node element of the target node element is placed in the reserved space. Of course, if the level of the target node element is higher than the level of the next level address element of the address to be matched, and the child node element of the target node element does not exist in the standard address tree, the target node element is determined as the terminal address element and added to the terminal address element set. At this time, the next node element that matches the next level address element of the address to be matched in the standard address tree is stored in the reserved space.

[0041] Furthermore, the address loss degree of each next node element is determined according to the similarity between each next node element and the next level address element of the address to be matched, and the next node element whose address loss degree meets the preset numerical condition is determined as the target node element.

[0042] It should be noted that if the address loss degrees of the aforementioned next node elements do not satisfy the preset numerical conditions, all next node elements are determined as end point address elements and added to the end point address element set.

[0043] Step 130: Update the target node element based on the next target node element, return to execute the next node element that matches the next-level address element of the address to be matched in the standard address tree according to the target node element, until the level of the next-level address element is lower than the level of the central address element, and determine the next target node element as the endpoint address element.

[0044] Specifically, the next target node element is used as the target node element, and the next node element that matches the next level address element of the address to be matched is determined in the standard address tree according to the target node element, so as to further determine the next node element corresponding to the next level address element of the address to be matched in the standard address tree, and then the next target node element can be determined, so as to determine the node element corresponding to each level address element corresponding to the address to be matched in the standard address tree. Of course, when it is determined that the level of the next level address element of the address to be matched is lower than the level of the central address element of the address to be matched, all the next target node elements at this time can be determined as the end point address elements and added to the end point address element set.

[0045] In the embodiment of the present invention, it is realized to determine the node elements corresponding to the address elements of each level corresponding to the address to be matched in the standard address tree, and the end point address element corresponding to the central address element of the address to be matched in the standard address tree.

[0046] Step 140: determine the to-be-matched standard address corresponding to each of the destination address elements in the standard address tree, and determine the standard address corresponding to the to-be-matched address in the to-be-matched standard addresses.

[0047] Specifically, the complete address link corresponding to each end point address element in the end point address element set is determined in the standard address tree, and then the complete address link corresponding to each end point address element can be determined as the standard address to be matched corresponding to each end point address element. The similarity between the address to be matched and each standard address to be matched is determined, and the address to be matched corresponding to the maximum similarity is determined as the standard address corresponding to the address to be matched, so as to achieve standard address matching of the address to be matched.

[0048] In an embodiment of the present invention, after determining all the destination address elements corresponding to the address to be matched, the standard address to be matched corresponding to each destination address element can be determined in the standard address tree, and then the standard address to be matched with the highest similarity to the address to be matched can be determined as the standard address corresponding to the address to be matched, thereby avoiding a large amount of calculation while achieving standard address matching of the address to be matched, and improving the accuracy of standard address matching.

[0049] The standard address determination method provided by the embodiment of the present invention includes: determining multiple levels of address elements and a central address element corresponding to the address to be matched, and determining a target node element in the highest node element that matches the highest level address element of the address to be matched in the standard address tree; determining a next node element that matches the next level address element of the address to be matched according to the target node element in the standard address tree, and determining a next target node element in the next node element; updating the target node element based on the next target node element, returning to execute the next node element that matches the next level address element of the address to be matched according to the target node element in the standard address tree, until the level of the next level address element is lower than the level of the central address element, and determining the next target node element as the terminal address element; determining the standard address to be matched corresponding to each of the terminal address elements in the standard address tree, and determining the standard address corresponding to the address to be matched in the standard address to be matched. The above technical scheme, first, performs address segmentation on the address to be matched to obtain the address elements and the central address element corresponding to the address elements to be matched; secondly, determines the highest node element matching the highest level address element of the address to be matched in the standard address tree; determines the target node element in the highest node element according to the similarity between each highest node element and the highest level address element of the address to be matched, so as to determine the target node element that better matches the highest level address element of the address to be matched; then, determines the next node element matching the next level address element of the address to be matched in the standard address tree according to the target node element, and determines the next target node element in the next node element; after updating the target node element based on the next target node element, continues to determine the next target node element until the level of the next level address element is lower than the level of the central address element; at this time, the next target node element can be determined as the terminal address element; determines the standard address to be matched corresponding to each terminal address element in the standard address tree; determines the standard address to be matched with the highest similarity to the address to be matched as the standard address corresponding to the address to be matched, thereby avoiding a large amount of calculation while achieving the standard address matching of the address to be matched, and improving the accuracy of the standard address matching.

[0050] Figure 3 A flowchart of another standard address determination method provided by an embodiment of the present invention. The embodiment of the present invention is applicable to situations where it is necessary to match the address to be matched to determine the standard address corresponding to the address to be matched. Based on the above embodiment, the embodiment of the present invention adds "when the address loss degree of each of the next node elements is greater than the preset numerical condition, each of the next node elements is determined as the end address element." The explanation of the terms that are the same or corresponding to the above embodiments will not be repeated here. Figure 3 , the standard address determination method provided by the embodiment of the present invention includes:

[0051] Step 310: Determine multiple levels of address elements and a central address element corresponding to the address to be matched.

[0052] In one implementation, step 310 may specifically include:

[0053] The address to be matched is segmented to obtain address elements of multiple levels; the weights of the address elements of each level are determined, and the address element corresponding to the maximum weight is determined as the central address element corresponding to the address to be matched.

[0054] Specifically, the address to be matched can be segmented to determine multiple levels of address elements corresponding to the address to be matched. Specifically, the address to be matched can be processed based on the named entity recognition model for the address entity to obtain address elements with geographical significance. Based on the named entity recognition model, the address to be matched Addr is segmented f(Addr) to obtain address elements corresponding to the address to be matched [(element type 1: element text 1), (element type 2: element text 2), ..., (element type n: element text n)], where Addr represents the address to be matched, function f represents the structured processing operation of the named entity recognition model on the address to be matched, [(element type 1: element text 1), (element type 2: element text 2), ..., (element type n: element text n)] represents the structured result obtained by the named entity recognition model performing the structured processing operation on the address to be matched, that is, a list of different types of address elements corresponding to the address to be matched, element type 1, element type 2, ..., element type n are address levels arranged in sequence, and element text 1, element text 2, ..., element text n are address elements of each level. For example, when the address to be matched is: "Room 1705, Unit 1, Building 66, West District, Nanyuan New Village, Yangshe Town, Zhangjiagang City, Suzhou City, Jiangsu Province", the structured result can be determined as multiple levels of address elements: "Province: Jiangsu | City: Suzhou City | County: Zhangjiagang City | Town: Yangshe Town | Residence: West District, Nanyuan New Village | BuildNum: Building 66 | Unit: Unit 1 | Room: Room 1705".

[0055] Of course, the address element or address element combination representing the destination or point of interest can also be determined as the central address element of the address to be matched, and the central address element represents the most noteworthy address element in the address to be matched. Specifically, the weights of the address elements of each level can be determined, and the address level corresponding to the maximum weight can be determined as the central address level. For example, when the address element of the address to be matched is "Province: Jiangsu | City: Suzhou City | County: Zhangjiagang City | Town: Yangshe Town | Residence: Nanyuan New Village West District | BuildNum: 66 Building | Unit: Unit 1 | Room: Room 1705", the central address element of the address to be matched can be determined as "Residence: Nanyuan New Village West District"; when the address element of the address to be matched is "City: Beijing | County: Daxing District | Road: Kechuang 11th Street | Institution: JD Building | BuildNum: Block A", the central address element of the address to be matched can be determined as "Institution: JD Building".

[0056] It should be noted that the named entity recognition model can define the level of address elements according to specific scenarios. Table 1 shows the level classification method of address elements applicable to express logistics address data. As shown in Table 1, the markings and meanings of address elements are as follows:

[0057] Table 1

[0058]

[0059]

[0060] In the embodiment of the present invention, the address to be matched is segmented to obtain address elements of multiple levels and a central address element corresponding to the address element to be matched.

[0061] Step 320: Determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree.

[0062] In one implementation, step 320 may specifically include:

[0063] Determine the highest node element that matches the highest level address element of the address to be matched in the standard address tree; determine the address loss degree of each highest node element based on the similarity between the highest level address element and each highest node element, and determine the highest node element whose address loss degree meets the preset numerical conditions as the target node element.

[0064] The minimum similarity between the standard address and the address to be matched is preset as St, and the weights of the address elements at each level are W City , WCounty , W Town , W Village , W Road , W Residence , W Institution , W School , W Build , the loss of address level missing is missing_loss.

[0065] The weights of the pre-set address elements of each level are normalized according to the levels of the address elements included in the address to be matched. The levels of the address elements included in the address to be matched can be normalized based on Formula 1 and Formula 2.

[0066]

[0067] Level_addr∈f(Addr) formula 2

[0068] Specifically, the address elements corresponding to the address to be matched are matched from high to low in the standard address tree. For example, the address elements corresponding to the address to be matched can be matched in the order of provincial administrative regions, prefecture-level cities and states, district and county-level units, township streets, village communities, roads, and POIs. First, the first node element that matches the first-level address element of the address to be matched is determined in the standard address tree. Specifically, starting from the root node element of the standard address tree, the node elements of each level in the standard address tree are placed in the retention space in turn. If there is a node element with a level higher than the level of the first-level address element of the address to be matched in the retention space, the node element is deleted from the retention space, and the child node elements of the node element in the standard address tree are placed in the retention space until the levels of all node elements in the retention space are less than or equal to the level of the first-level address element, and the node element stored in the retention space is determined as the first node element that matches the first-level address element of the address to be matched in the standard address tree.

[0069] The similarity between the first node element and the first-level address element is calculated based on the cosine similarity method. When the node stores the historical name and / or alias of the first node element, the similarity between the first-level address element and the standard name, historical name and / or alias of the first node element can be determined based on the cosine similarity method, and the maximum similarity is determined as the similarity between the first-level address element and the first node element. Further, the address loss degree of the first node element is determined based on the similarity between the first node element and the first-level address element.

[0070] When the level of the first node element is consistent with the level of the first-level address element, the address loss degree of the first node element can be determined based on formula 3. When the level of the first node element is lower than the level of the first-level address element, the address loss degree of the first node element can be determined based on formula 4.

[0071] Addr_loss=Addr_loss+Wnormal Level_addr *min(1-Coef_alike, missing_loss)

[0072] Formula 3

[0073] Addr_loss=Addr_loss+Wnormal Level_addr *missing_loss formula 4

[0074] Among them, Addr_loss represents the address loss degree, Wnormal Level_addr It represents the normalized level weight, Coef_alike represents the similarity, and missing_loss represents the loss of address level missing.

[0075] The addend Addr_loss in Formula 3 and Formula 4 represents the initial address loss degree of the node element in the retention space. In the present application, the initial address loss degree of the node element in the retention space is 0.

[0076] The preset numerical condition is determined by the minimum similarity St between the standard address and the address to be matched. For example, the preset numerical condition may be less than 1-St. If the address loss degree of the first node element is less than 1-St, it is determined that the first node element meets the preset numerical condition, and the first node element can be determined to be the first target node element. If the address loss degree of the first node element is greater than or equal to 1-St, it is determined that the first node element does not meet the preset numerical condition, and the first node element can be deleted from the retention space.

[0077] In an embodiment of the present invention, a highest node element that matches the highest level address element of the address to be matched is determined in a standard address tree, and based on the similarity between each highest node element and the highest level address element of the address to be matched, a target node element that better matches the highest level address element of the address to be matched is determined in the highest node elements.

[0078] Step 330: Determine the next node element that matches the next level address element of the address to be matched in the standard address tree according to the target node element, and determine the next target node element in the next node element.

[0079] In one implementation, step 330 may specifically include:

[0080] If the level of the target node element is consistent with the level of the next-level address element, the target node element is determined as the next node element that matches the next-level address element; if the level of the target node element is inconsistent with the level of the next-level address element, the child node element corresponding to the target node element is determined as the next node element that matches the next-level address element; the address loss degree of each next node element is determined based on the similarity between the next-level address element and each next node element, and the next node element whose address loss degree meets the preset numerical conditions is determined as the next target node element.

[0081] Specifically, at this time, the first target node element that is more closely matched with the highest-level address element of the address to be matched is stored in the reserved space. If the level of the first target node element is consistent with the level of the second-level address element, the first target node element is determined as the second node element that matches the second-level address element. If the level of the first target node element is higher than the level of the second-level address element, the child node element corresponding to the first target node element in the standard address tree is determined as the second node element that matches the second-level address element. If the child node element corresponding to the first target node element does not exist in the standard address tree, the first target node element is determined as the destination address element and added to the destination address element set. At this time, all node elements stored in the reserved space can be determined as the second node elements that match the second-level address element of the address to be matched.

[0082] Further, determining the address loss degree of each of the next node elements according to the similarity between the next level address element and each of the next node elements includes:

[0083] The similarity between the next-level address element and the next node element is less than the address level loss, and the address loss degree of the next node element is determined based on the address level loss degree; the similarity between the next-level address element and the next node element is greater than the address level loss degree, and the address loss degree of the next node element is determined based on the similarity between the next-level address element and the next node element.

[0084] Specifically, the similarity between the second node element and the second-level address element is calculated, and the address loss degree of the second node element is determined according to the similarity between the second node element and the second-level address element. When the level of the second node element is consistent with the level of the second-level address element, the address loss degree of the second node element can be determined based on Formula 3, and when the level of the second node element is lower than the level of the second-level address element, the address loss degree of the second node element can be determined based on Formula 4.

[0085] At this time, the second node element is the first target node element or a child node element of the first target node element. When the second node element is the first target node element, the addend Addr_loss in Formula 3 and Formula 4 is the address loss degree of the target node element. When the second node element is the child node element of the first target node element, the addend Addr_loss in Formula 3 and Formula 4 is the address loss degree of the parent node element corresponding to the child node element.

[0086] At this time, the address of each destination address element in the destination address element set may also be updated based on Formula 5.

[0087] Addr_loss = Addr_loss +Wnormal Level_addr Formula 5

[0088] If the address loss degree of the second node element is less than 1-St, it is determined that the second node element meets the preset numerical condition, and the second node element can be determined to be the second target node element. If the address loss degree of the second node element is greater than or equal to 1-St, it is determined that the second node element does not meet the preset numerical condition, and the second node element can be deleted from the retention space.

[0089] Optionally, if the address loss degrees of the second node elements do not satisfy a preset numerical condition, all the second node elements are determined as destination address elements and added to the destination address element set.

[0090] Step 340: Update the target node element based on the next target node element, return to execute in the standard address tree, determine the next node element that matches the next-level address element of the address to be matched according to the target node element, and determine the next target node element in the next node element until the level of the next-level address element is lower than the level of the central address element, and determine the next target node element as the endpoint address element.

[0091] Specifically, the second target node element is used as the target node element, and the next node element that matches the next level address element of the address to be matched is determined in the standard address tree according to the target node element, and the next target node element is determined in the next node element, so as to further determine the third node element corresponding to the third level address element of the address to be matched in the standard address tree, and then the third target node element can be determined, so as to determine the node elements corresponding to each level address element corresponding to the address to be matched in the standard address tree. Of course, when it is determined that the level of the next level address element of the address to be matched is lower than the level of the central address element of the address to be matched, all the next target node elements determined at this time can be determined as the terminal address elements and added to the terminal address element set.

[0092] In the embodiment of the present invention, it is realized to determine the node elements corresponding to the address elements of each level corresponding to the address to be matched in the standard address tree, and the end point address element corresponding to the central address element of the address to be matched in the standard address tree.

[0093] Step 350: determine the to-be-matched standard address corresponding to each of the destination address elements in the standard address tree, and determine the standard address corresponding to the to-be-matched address in the to-be-matched standard addresses.

[0094] In one implementation, step 350 may specifically include:

[0095] Reverse root search is performed on each of the endpoint address elements in the standard address tree to determine the complete address link corresponding to each of the endpoint address elements; the complete address link corresponding to each of the endpoint address elements is determined as the standard address to be matched corresponding to each of the endpoint address elements; the similarity between each of the standard addresses to be matched and the address to be matched is determined, and the standard address to be matched corresponding to the maximum similarity is determined as the standard address corresponding to the address to be matched.

[0096] Specifically, each destination address element in the destination address element set is rooted in reverse in the standard address tree to determine the complete address link corresponding to each destination address element. Then, the complete address link corresponding to each destination address element can be determined as the standard address to be matched corresponding to each destination address element. Of course, if there are multiple complete address links corresponding to the destination address element, each complete address link is determined as the standard address to be matched corresponding to the destination address element.

[0097] Determine the similarity between the address to be matched and each standard address to be matched. On the one hand, the similarity between the address to be matched and the standard address to be matched corresponding to the end address element can be determined according to the address loss of the end address element. For example, the similarity between the address to be matched and the standard address to be matched corresponding to the end address element can be determined as poi_alike=1-Addr_loss, where Addr_loss is the address loss of the end address element. On the other hand, the similarity between the address to be matched and each standard address to be matched can be determined based on the cosine similarity method. Then, the address to be matched corresponding to the maximum similarity is determined as the standard address corresponding to the address to be matched, so as to achieve standard address matching of the address to be matched.

[0098] As described in the previous embodiment, after determining all the destination address elements corresponding to the address to be matched, the standard address to be matched corresponding to each destination address element can be determined in the standard address tree, and then the standard address to be matched with the highest similarity to the address to be matched can be determined as the standard address corresponding to the address to be matched, thereby avoiding a large amount of calculation while achieving standard address matching of the address to be matched, and improving the accuracy of standard address matching.

[0099] The standard address determination method provided by the embodiment of the present invention includes: determining multiple levels of address elements and a central address element corresponding to the address to be matched; determining a target node element in the highest node element that matches the highest level address element of the address to be matched in the standard address tree; determining a next node element that matches the next level address element of the address to be matched according to the target node element in the standard address tree, and determining the next target node element in the next node element; updating the target node element based on the next target node element, returning to execute the next node element that matches the next level address element of the address to be matched according to the target node element in the standard address tree, and determining the next target node element in the next node element, until the level of the next level address element is lower than the level of the central address element, and determining the next target node element as the terminal address element; determining the standard address to be matched corresponding to each of the terminal address elements in the standard address tree, and determining the standard address corresponding to the address to be matched in the standard address to be matched. The above technical scheme firstly performs address segmentation on the address to be matched to obtain the address element and the central address element corresponding to the address element to be matched; secondly, determines the highest node element matching the highest level address element of the address to be matched in the standard address tree; determines the target node element in the highest node element according to the similarity between each highest node element and the highest level address element of the address to be matched, thereby determining the target node element that better matches the highest level address element of the address to be matched; furthermore, determines the next node element matching the next level address element of the address to be matched in the standard address tree according to the target node element; determines the next target node element in the next node element, thereby determining the next target node element that better matches the next level address element of the address to be matched; based on the next After the target node element updates the target node element, continue to determine the next target node element that better matches the lower-level address of the address to be matched, until the level of the next-level address element is lower than the level of the central address element. At this time, the next target node element can be determined as the endpoint address element, so as to determine the node elements corresponding to the address elements of each level corresponding to the address to be matched in the standard address tree, and the endpoint address elements corresponding to the central address element of the address to be matched in the standard address tree, determine the standard address to be matched corresponding to each endpoint address element in the standard address tree, and determine the standard address to be matched with the highest similarity to the address to be matched as the standard address corresponding to the address to be matched, thereby avoiding a large amount of calculation while achieving standard address matching of the address to be matched, and improving the accuracy of standard address matching.

[0100] In addition, the design of address level weights and reserved space increases the fault tolerance for missing address elements and space constraint errors, solving the problem of address matching failure when address elements are missing or space constraints are wrong. By designing address level weights and reserved space, the standard address corresponding to the address to be matched can be matched even when address elements are missing or space constraints are wrong.

[0101] Figure 4 The flowchart of another standard address determination method provided in the embodiment of the present invention exemplarily provides one of the implementation methods. Figure 4 As shown, including:

[0102] Step 410: Determine multiple levels of address elements and a central address element corresponding to the address to be matched.

[0103] Step 411, determine Level_addr as the current address level of the address to be matched, determine the node element that matches the address element of the current address level of the address to be matched in the standard address tree, determine the target node element in the node elements, and store the target node element in node_alive.

[0104] Specifically, the current address level may be determined to be the address level from the highest address level of the address to be matched to the address level of the central address element.

[0105] Step 412: Update Level_addr to the next address level of the address to be matched.

[0106] Step 413: Determine whether node_alive is empty.

[0107] When it is determined that node_alive is empty, execute step 417; otherwise, execute step 414.

[0108] Step 414: Determine whether Level_addr is empty.

[0109] When it is determined that Level_addr is empty, execute step 417; otherwise, execute step 415.

[0110] Step 415: Update the reserved space.

[0111] Specifically, when updating the retained space, when the level of the target node element is consistent with the level of the next-level address element, the target node element can be determined as the next node element that matches the next-level address element; when the level of the target node element is inconsistent with the level of the next-level address element, the child node element corresponding to the target node element is determined as the next node element that matches the next-level address element, and the retained space is updated based on the next node element.

[0112] Step 416: Determine whether the reserved space is empty.

[0113] When it is determined that the reserved space is empty, execute step 417; otherwise, return to execute step 411.

[0114] Step 417: determine the target node element as the destination address element, and add the destination address element to the destination address element set.

[0115] Step 418: determine the standard address to be matched corresponding to each destination address element in the destination address element set in the standard address tree, determine the similarity between each standard address to be matched and the address to be matched, and determine the standard address to be matched corresponding to the maximum similarity as the standard address corresponding to the address to be matched.

[0116] In a specific implementation manner, St is preset to be 0.85, W City =0.1, W County =0.1, W Town =0.15, W Village =0.15, W Road =0.15, W Residence =0.25, W Institution =0.25, W School =0.25, W Build =0.25, missing_loss=0.5.

[0117] When the address to be matched is Yijia Specialty Restaurant near No. 10-15, Lundu Road, Tianmenshan Street, Jinghu District, Wuhu City, Anhui Province, the matching address is segmented to obtain multiple levels of address elements: Province: Anhui Province | City: Wuhu City | County: Jinghu District | Town: Tianmenshan Street | Road: Lundu Road | RoadNum: No. 10-15 | Location: Nearby | Institution: Yijia Specialty Restaurant, and the central address element: Yijia Specialty Restaurant. Update the address level weight to obtain W City =0.133, W County =0.133, W Town =0.200, W Road =0.200, W Institution=0.333. Perform standard address matching: Level_addr=Province; Reserved space M={{Anhui Province: Level=Province, Addr_loss=0};}; Determine the first node element: Level_addr=Province; Reserved space M={{Anhui Province: Level=Province, Addr_loss=0};}; Update reserved space: Level_addr=City; Reserved space M={{Wuhu City: Level=City, Addr_loss=0};}; Determine the second node element: Level_addr=City; Reserved space M={{Wuhu City: Level=Ci ty, Addr_loss=0};}; Update the reserved space: Level_addr=County; Reserved space M={{Jinghu District: Level=County, Addr_loss=0}, {Jiujiang District: Level=County, Addr_loss=0}, {Yijiang District: Level=County, Addr_loss=0}…}; Determine the third node element: Level_addr=County; Reserved space M={{Jinghu District: Level=County, Addr_loss=0}, {Jiujiang District: Level=County, Addr_loss=0.062}, {Yijiang District :Level=County,Addr_loss=0.062}…}};Update reserved space: Level_addr=Town;Reserved space M={{Fangcun Subdistrict: Level=Town,Addr_loss=0}、{Yijishan Subdistrict: Level=Town,Addr_loss=0}、{Tianmenshan Subdistrict: Level=Town,Addr_loss=0}、…{Huolong Subdistrict: Level=Town,Addr_loss=0.062}、{Wanchun Subdistrict: Level=Town,Addr_loss=0.062}…{District Government: Level=Institution, Addr_loss=0}…}; Determine the fourth node element: Level_addr=Town; Reserve space M={{Fangcun Subdistrict: Level=Town, Addr_loss=0.1}, {Yijishan Subdistrict: Level=Town, Addr_loss=0.081}, {Tianmenshan Subdistrict: Level=Town, Addr_loss=0}, …{Huolong Subdistrict: Level=Town, Addr_loss=0.162}, {Wanchun Subdistrict: Level=Town, Addr_loss=0.162}…{District Government: Level=Institution, Addr_loss=0.1}…}; Update the reserved space: i.Level_addr=Road; Reserved space M={{Fangtang Community: Level=Village, Addr_loss=0.1}…, {Dainan Community: Level=Village, Addr_loss=0.1}, …{Huayuan Community: Level=Village, Addr_loss=0.081}, …{Xingyuan Community: Level=Village, Addr_loss=0}, {Hongxing Community: Level=Village, Addr_loss=0}…{Limin Road: level=Road, Addr_loss=0. 1}…{Yijishan Hospital::Level=Institution,Addr_loss=0.081}…{People's Government:Level=Institution,Addr_loss=0.1}…};ii.Level_addr=Road; Reserved space M={{Lundu Road:Level=road,Addr_loss=0.081},{Changjiang Middle Road:Level=road,Addr_loss=0.081},{Changjiang West Road:Level=road,Addr_loss=0.081},…{Yinhu Middle Road:Level=road,Addr_loss=0.1}…};ii.Level_addr=Road; Reserved space M={{Lundu Road:Level=road,Addr_loss=0.081},{Changjiang Middle Road:Level=road,Addr_loss=0.081},{Changjiang West Road:Level=road,Addr_loss=0.081},…{Yinhu Middle Road:Level=road,Addr_loss=0.1}…}; s=0}、{Changjiang North Road: Level=road,Addr_loss=0}、…{Limin Road: level=Road,Addr_loss=0.1}、{Huajin South Road: level=Road,Addr_loss=0.1}…{Yijishan Hospital: Level=Institution,Addr_loss=0.1}……{District Government: Level=Institution,Addr_loss=0.1}…};Determine the fifth target node element: i.Level_addr=Road;Retain space M={{Lundu Road: Level=road,Addr_loss =0.081}, {Changjiang Middle Road: Level=road, Addr_loss=0.181}, {Changjiang West Road: Level=road, Addr_loss=0.181}, …{Yinhu Middle Road: Level=road, Addr_loss=0.1}, {Changjiang North Road: Level=road, Addr_loss=0.1}, …{Limin Road: level=Road, Addr_loss=0.2}, {Huajin South Road: level=Road, Addr_loss=0.2} …{Yijishan Hospital: Level=Institution, Addr_loss=0.2}...{District Government: Level=Institution, Addr_loss=0.2}...}; Update the reserved space: i.Level_addr=Institution, reserved space M={{Yijia Specialty Restaurant: Level=Institution, Addr_loss=0.081}, {China Mobile: Level=Institution, Addr_loss=0.081}, {Huayi Supermarket: Level=Institution, Addr_loss=0.081},...{Yiji Villa: Level=Residence, Addr _loss=0.081}、{Binjiang Cuizhu Garden: Level=Residence,Addr_loss=0.081}…{Shicheng Community: Level=Residence,Addr_loss=0.1}、{Ruian Motor Vehicle Inspection Field: Level=Institution,Addr_loss=0.1}};ii.Level_addr=Institution;Retained space M={{Yijia Specialty Restaurant: Level=Institution,Addr_loss=0.081}、{China Mobile: Level=Institution,A ddr_loss=0.081}、{Huayi Supermarket: Level=Institution,Addr_loss=0.081}、…{Authentic Huainan Beef Soup: Level=Residence,Addr_loss=0.1}、{Cainiao Station: Level=Residence,Addr_loss=0.1}…{Ruian Motor Vehicle Inspection Field: Level=Institution,Addr_loss=0.1};};Determine the sixth target node element: i.Level_addr=Institution;Retain space M={{Yijia Specialty Catering: Level l=Institution,Addr_loss=0.081}、{China Mobile: Level=Institution,Addr_loss=0.247}、{Huayi Supermarket: Level=Institution,Addr_loss=0.247}、…{Authentic Huainan Beef Soup: Level=Residence,Addr_loss=0.266}、{Cainiao Station: Level=Residence,Addr_loss=0.266}…{Ruian Motor Vehicle Inspection Center: Level=Institution,Addr_loss=0.266};}; Update the reserved space: Level_addr = empty set; reserved space M = {{Yijia Specialty Catering: Level = Institution, Addr_loss = 0.081}}; Destination address element = {{Yijia Specialty Catering: Level = Institution, Addr_loss = 0.081}}. .

[0118] Search for the complete link from Yijia Specialty Restaurant to Anhui Province in the standard address tree, and obtain Yijia Specialty Restaurant at Lundu Road, Yijishan Street, Jinghu District, Wuhu City, Anhui Province Addr_loss = 0.081. Yijia Specialty Restaurant at Lundu Road, Yijishan Street, Jinghu District, Wuhu City, Anhui Province can be determined as the standard address corresponding to Yijia Specialty Restaurant near No. 10-15, Lundu Road, Tianmenshan Street, Jinghu District, Wuhu City, Anhui Province. The similarity of the standard address to the address to be matched is 0.919.

[0119] When the address to be matched is Building 67, Wanchun Heyuan, Wanchun Street, Jiujiang District, Wuhu City, the matching address is segmented to obtain multiple levels of address elements: City: Wuhu City | County: Jiujiang District | Town: Wanchun Street | Residence: Wanchun Heyuan | BuildNum: Building 67, and the central address element: Wanchun Heyuan. Update the address level weight to obtain Wnormal City =0.182, Wnormal County =0.182, Wnormal Town =0.273, Wnormal Residence=0.363. Perform standard address matching: Level_addr=City; Reserved space M={{Wuhu City: Level=City, Addr_loss=0};}; Determine the first node element: Level_addr=City; Reserved space M={{Wuhu City: Level=City, Addr_loss=0};}; Update reserved space: Level_addr=County; Reserved space M={{Jinghu District: Level=County, Addr_loss=0}, {Jiujiang District: Level=County, Addr_loss=0};} ss=0}、{Yijiang District: Level=County,Addr_loss=0}…};Determine the second node element: Level_addr=County;Retain space M={{Jinghu District: Level=County,Addr_loss=0.182}、{Jiujiang District: Level=County,Addr_loss=0}、{Yijiang District: Level=County,Addr_loss=0.182}…}};Update the retained space: Level_addr=Town;Retain space M={{Siheshan Street: L evel=Town,Addr_loss=0}、{Guandou Subdistrict: Level=Town,Addr_loss=0}、{Qingshui Subdistrict: Level=Town,Addr_loss=0}、{Wanchun Subdistrict: Level=Town,Addr_loss=0}、{Erba Town: Level=Town,Addr_loss=0}…{District Government: Level=Institution,Addr_loss=0}…};Determine the third node element: Level_addr=Town;Reserve space M={{four Heshan Subdistrict: Level = Town, Addr_loss = 0.268}, {Guandou Subdistrict: Level = Town, Addr_loss = 0.268}, {Qingshui Subdistrict: Level = Town, Addr_loss = 0.268}, {Wanchun Subdistrict: Level = Town, Addr_loss = 0}, {Erba Town: Level = Town, Addr_loss = 0.273}…{District Government: Level = Institution, Addr_loss = 0.136}…}; Update the reserved space: i.Level_addr = Residence; reserved space M = {{Tonghe Community: Level = village, Addr_loss = 0}, {Daiduo Community: Level = village, Addr_loss = 0}, {Nanxin Community: Level = village, Addr_loss = 0}, {Mulong Community: Level = village, Addr_loss = 0}, ... {Chizhushan East Road: Level = Road, Addr_loss = 0}, {Qingshuihe Road: Level = Road, Addr_loss = 0} ... {Wanchun Middle School: level = school, Addr_loss = 0}, {Wanchun Fortune Plaza, level = build, Addr_loss = 0} ... {District Government: Level = Institution, Addr_loss = 0.136} ...}; ii. Level_addr = Residence; reserved space M = {{Wanchun East Road: Level = Road, Addr_loss = 0}, {Ouyanghu Road: Level = village, Addr_loss = 0}, {Mengxi Road: Level = Road, Addr_loss = 0}, {Jingsan Road: Level = Road, Addr_loss = 0}, {Jingliu Road: Level = Road, Addr_loss = 0}, … {Wuhu First People's Hospital: Level = Institution, Addr_loss = 0}, {Dongcheng Haoting: Level = Residence, Addr_loss = 0}, {Fantawild Dreamland: Level = build, Addr_loss = 0} … {Wanchun Middle School: level = school, Addr_loss = 0}, {Wanchun Fortune Plaza, level = build, Addr_loss = 0} … {District Government: Level = Institution, Addr_loss = 0.136} …}; iii.Level_addr = Residence; reserved space M = {{Wuhu Hengtian Industrial Co., Ltd.: Level = Institution, Addr_loss = 0}, {Nanxiang Wanshang Building Materials City: Level = build, Addr_loss = 0}, {Wanchun New Garden Leyuan: Level = Residence, Addr_loss = 0}, {Wanchun New Garden Yayuan: Level = Residence, Addr_loss = 0}, {Wanchun New Garden: Level = Residence, Addr_loss = 0}, {Wanchun New Garden B District: Level = Residence, Addr _loss=0}、{Wanchun Garden: Level=Residence,Addr_loss=0}、{Yi Ju Chunshui Bay: Level=Residence,Addr_loss=0}、…{Wuhu First People's Hospital: Level=Institution,Addr_loss=0}、{Dongcheng Haoting: Level=Residence,Addr_loss=0}、{Fantawild Dreamland: Level=build,Addr_loss=0}…{Wanchun Middle School: level=school,Addr_loss=0}、{Wanchun Fortune Plaza,level=build,Addr_loss=0} dr_loss=0}…{District Government: Level=Institution,Addr_loss=0.136}…}; Determine the fourth node element: Level_addr=Town; Retain space M={{Wuhu Hengtian Industrial Co., Ltd.: Level=Institution,Addr_loss=0.363}、{Nanxiang Wanshang Building Materials City: Level=build,Addr_loss=0.182}、{Wanchun New Garden Leyuan: Level=Residence,Addr_loss=0.095}、{Wanchun New Garden Yayuan: Level=Residence,Addr_loss=0. s=0.095}、{Wanchun New Garden: Level=Residence,Addr_loss=0.075}、{Wanchun New Garden Area B: Level=Residence,Addr_loss=0}、{Wanchun Garden: Level=Residence,Addr_loss=0.173}、{Yi Ju Chunshui Bay: Level=Residence,Addr_loss=0.363}、…{Wuhu First People's Hospital: Level=Institution,Addr_loss=0.182}、{Dongcheng Haoting: Level=Residence,Addr_loss=0.363}、{Fantasy Dreamland: Level = build, Addr_loss = 0.182}…{Wanchun Middle School: level = school, Addr_loss = 0.182}、{Wanchun Fortune Plaza, level = build, Addr_loss = 0.182}…{District Government: Level = Institution, Addr_loss = 0.318}…}; Update reserved space: Level_addr = empty set; reserved space M = {{Wanchun New Garden Leyuan: Level = Residence, Addr_loss = 0.095}、{Wanchun New Garden Yayuan: Level = Residence, Addr_ loss=0.095}、{Wanchun New Garden: Level=Residence,Addr_loss=0.075}、{Wanchun New Garden B District: Level=Residence,Addr_loss=0}};Destination address element={{Wanchun New Garden Leyuan: Level=Residence,Addr_loss=0.095}、{Wanchun New Garden Yayuan: Level=Residence,Addr_loss=0.095}、{Wanchun New Garden: Level=Residence,Addr_loss=0.075}、{Wanchun New Garden B District: Level=Residence,Addr_loss=0}}。.

[0120] In the standard address tree, we search for the complete links from Wanchun New Garden Leyuan, Wanchun New Garden Yayuan, Wanchun New Garden, and Wanchun New Garden B District to Anhui Province, and get the corresponding Wanchun New Garden Leyuan Address of Anhui Province Wuhu City Jiujiang District Wanchun Street Mengxi Road Wanchun New Garden Leyuan Address = 0.095 and Anhui Province Wuhu City Jiujiang District Wanchun Street Wei Erji Road Wanchun New Garden Leyuan Address = 0.095, and the corresponding Wanchun New Garden Yayuan Address of Anhui Province Wuhu City Jiujiang District Wanchun Street Mengxi Road Wanchun New Garden Yayuan Address = 0.095. Chunxinyuan corresponds to Wanchunxinyuan, Ouyang Lake Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province Addr_loss=0.075 and Wanchunxinyuan, Weiyi Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province Addr_loss=0.075; Wanchunxinyuan District B corresponds to Wanchunxinyuan District B, Ouyang Lake Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province Addr_loss=0; Wanchunxinyuan District B, Fortune Street, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province Addr_loss=0 and Wanchunxinyuan B, Wanchun Lake Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province Addr_loss=0.

[0121] Wanchun New Garden Area B, Wanchun Lake Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province, Wanchun New Garden Area B, Fortune Street, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province, and Wanchun New Garden Area B, Ouyang Lake Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province can be identified as the standard addresses corresponding to Building 67, Wanchun Heyuan, Wanchun Street, Jiujiang District, Wuhu City, and the similarity of the standard addresses to the addresses to be matched is 1. Wanchun Xinyuan on Ouyanghu Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province and Wanchun Xinyuan on Weiyi Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province can also be determined as the first candidate standard addresses corresponding to Building 67, Wanchun Heyuan, Wanchun Street, Jiujiang District, Wuhu City, and the similarity of the first candidate standard address to the address to be matched is 0.927, and Wanchun Xinyuan Leyuan on Mengxi Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province, Wanchun Xinyuan Leyuan on Weiyi Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province, and Wanchun Xinyuan Yayuan on Mengxi Road, Wanchun Street, Jiujiang District, Wuhu City, Anhui Province can be determined as the second candidate standard addresses corresponding to Building 67, Wanchun Heyuan, Wanchun Street, Jiujiang District, Wuhu City, and the similarity of the second candidate standard address to the address to be matched is 0.905.

[0122] The implementation method of the standard address determination method provided by the embodiment of the present invention has the corresponding functional modules and beneficial effects for executing the standard address determination method.

[0123] Figure 5 The following is a schematic diagram of a standard address determination device provided in an embodiment of the present invention. The device and the standard address determination method in the above embodiments belong to the same inventive concept. For details not described in detail in the embodiment of the standard address determination device, please refer to the embodiment of the above standard address determination method.

[0124] The specific structure of the standard address determination device is as follows Figure 5 As shown, including:

[0125] A first determination module 510 is used to determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree;

[0126] A second determination module 520, configured to determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element in the next node element;

[0127] An updating module 530 is used to update the target node element based on the next target node element, return to execute the next node element that matches the next level address element of the address to be matched in the standard address tree according to the target node element, until the level of the next level address element is lower than the level of the central address element, and determine the next target node element as the end point address element;

[0128] The execution module 540 is used to determine the to-be-matched standard address corresponding to each of the end point address elements in the standard address tree, and determine the standard address corresponding to the to-be-matched address in the to-be-matched standard addresses.

[0129] Based on the above embodiment, the first determining module 510 is specifically configured to:

[0130] The address to be matched is segmented to obtain address elements of multiple levels; the weights of the address elements of each level are determined, and the address element corresponding to the maximum weight is determined as the central address element corresponding to the address to be matched; the highest node element that matches the highest-level address element of the address to be matched is determined in the standard address tree; the address loss degree of each highest node element is determined based on the similarity between the highest-level address element and each of the highest node elements, and the highest node element whose address loss degree meets a preset numerical condition is determined as the target node element.

[0131] Based on the above embodiment, the second determining module 520 is specifically configured to:

[0132] If the level of the target node element is consistent with the level of the next-level address element, the target node element is determined as the next node element that matches the next-level address element; if the level of the target node element is inconsistent with the level of the next-level address element, the child node element corresponding to the target node element is determined as the next node element that matches the next-level address element; the address loss degree of each next node element is determined based on the similarity between the next-level address element and each next node element, and the next node element whose address loss degree meets the preset numerical conditions is determined as the next target node element.

[0133] In one implementation, the preset numerical condition is determined by the minimum similarity between the address to be matched and the standard address.

[0134] In one implementation, determining the address loss degree of each of the next node elements according to the similarity between the next level address element and each of the next node elements includes:

[0135] The similarity between the next-level address element and the next node element is less than the address level loss, and the address loss degree of the next node element is determined based on the address level loss degree; the similarity between the next-level address element and the next node element is greater than the address level loss degree, and the address loss degree of the next node element is determined based on the similarity between the next-level address element and the next node element.

[0136] Optionally, the device further comprises:

[0137] The supplementary determination module is used to determine each of the next node elements as the end address element when it is determined that the address loss degree of each of the next node elements does not meet the preset numerical condition.

[0138] Based on the above embodiment, the execution module 540 is specifically used to:

[0139] Reverse root search is performed on each of the endpoint address elements in the standard address tree to determine the complete address link corresponding to each of the endpoint address elements; the complete address link corresponding to each of the endpoint address elements is determined as the standard address to be matched corresponding to each of the endpoint address elements; the similarity between each of the standard addresses to be matched and the address to be matched is determined, and the standard address to be matched corresponding to the maximum similarity is determined as the standard address corresponding to the address to be matched.

[0140] The standard address determination device provided in the embodiment of the present invention can execute the standard address determination method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of executing the standard address determination method.

[0141] It is worth noting that in the embodiment of the above-mentioned standard address determination device, the various units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the present invention.

[0142] Figure 6 A schematic diagram of the structure of a computer device provided in an embodiment of the present invention. Figure 6 A block diagram of an exemplary computer device 6 suitable for use in implementing embodiments of the present invention is shown. Figure 6 The computer device 6 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0143] like Figure 6 As shown, the computer device 6 is in the form of a general purpose computing electronic device. The components of the computer device 6 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 connecting various system components (including the system memory 28 and the processing unit 16).

[0144] Bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor or a local bus using any of a variety of bus architectures. By way of example, these architectures include, but are not limited to, an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MAC) bus, an Enhanced ISA bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnect (PCI) bus.

[0145] The computer device 6 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the computer device 6, including volatile and non-volatile media, removable and non-removable media.

[0146] The system memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The computer device 6 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media ( Figure 6 not shown, usually called a "hard drive"). Although Figure 6 Not shown in the figure, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, a DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 18 via one or more data medium interfaces. The system memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present invention.

[0147] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in system memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. Program modules 42 generally perform the functions and / or methods of the embodiments described herein.

[0148] The computer device 6 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), one or more devices that enable a user to interact with the computer device 6, and / or any device that enables the computer device 6 to communicate with one or more other computing devices (e.g., network card, modem, etc.). Such communication may be performed through an input / output (I / O) interface 22. Furthermore, the computer device 6 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 20. Figure 6 As shown, the network adapter 20 communicates with other modules of the computer device 6 via the bus 18. It should be understood that although Figure 6 Not shown, other hardware and / or software modules may be used in conjunction with computer device 6, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0149] The processing unit 16 executes various functional applications and page displays by running the program stored in the system memory 28, for example, implementing the standard address determination method provided in the embodiment of the present invention, which includes:

[0150] Determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree;

[0151] Determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element in the next node element;

[0152] Based on the next target node element, the target node element is updated, and the next node element that matches the next level address element of the address to be matched is determined according to the target node element in the standard address tree, until the level of the next level address element is lower than the level of the central address element, and the next target node element is determined as the end point address element;

[0153] The to-be-matched standard address corresponding to each of the destination address elements is determined in the standard address tree, and the standard address corresponding to the to-be-matched address is determined in the to-be-matched standard addresses.

[0154] Of course, those skilled in the art can understand that the processor can also implement the technical solution of the standard address determination method provided by any embodiment of the present invention.

[0155] An embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the standard address determination method provided in the embodiment of the present invention is implemented, for example, and the method includes:

[0156] Determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree;

[0157] Determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element in the next node element;

[0158] Based on the next target node element, the target node element is updated, and the next node element that matches the next level address element of the address to be matched is determined according to the target node element in the standard address tree, until the level of the next level address element is lower than the level of the central address element, and the next target node element is determined as the end point address element;

[0159] The to-be-matched standard address corresponding to each of the destination address elements is determined in the standard address tree, and the standard address corresponding to the to-be-matched address is determined in the to-be-matched standard addresses.

[0160] The computer storage medium of the embodiment of the present invention can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this document, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0161] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0162] The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0163] Computer program code for performing the operations of the present invention may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0164] It should be understood by those skilled in the art that the modules or steps of the present invention described above can be implemented by a general-purpose computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, optionally, they can be implemented by a program code executable by a computer device, so that they can be stored in a storage device and executed by the computing device, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.

[0165] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A standard address determination method, characterized in that: include: Determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree; Determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element in the next node element; Based on the next target node element, the target node element is updated, and the next node element that matches the next level address element of the address to be matched is determined according to the target node element in the standard address tree, until the level of the next level address element is lower than the level of the central address element, and the next target node element is determined as the end point address element; The to-be-matched standard address corresponding to each of the destination address elements is determined in the standard address tree, and the standard address corresponding to the to-be-matched address is determined in the to-be-matched standard addresses.

2. The method for determining a standard address according to claim 1, characterized in that: Determine multiple levels of address elements and a central address element corresponding to the address to be matched, including: Segmenting the address to be matched to obtain multiple levels of address elements; The weights of address elements at each level are determined, and the address element corresponding to the maximum weight is determined as the central address element corresponding to the address to be matched.

3. The method for determining a standard address according to claim 1, characterized in that: Determining a target node element from the highest node element matching the highest level address element of the address to be matched in the standard address tree comprises: Determine in the standard address tree the highest node element that matches the highest level address element of the address to be matched; The address loss degree of each of the highest node elements is determined according to the similarity between the highest level address element and each of the highest node elements, and the highest node element whose address loss degree meets a preset numerical condition is determined as the target node element.

4. The method for determining a standard address according to claim 3, characterized in that: Determining a next node element matching the next level address element of the address to be matched in the standard address tree according to the target node element, and determining a next target node element in the next node element, comprising: The level of the target node element is consistent with the level of the next-level address element, and the target node element is determined as the next node element matching the next-level address element; The level of the target node element is inconsistent with the level of the next-level address element, and the child node element corresponding to the target node element is determined as the next node element matching the next-level address element; The address loss degree of each of the next node elements is determined according to the similarity between the next level address element and each of the next node elements, and the next node element whose address loss degree meets a preset numerical condition is determined as the next target node element.

5. The method for determining a standard address according to claim 3 or 4, characterized in that: The preset numerical condition is determined by the minimum similarity between the address to be matched and the standard address.

6. The method for determining a standard address according to claim 4, characterized in that: Determining the address loss degree of each of the next node elements according to the similarity between the next level address element and each of the next node elements includes: The similarity between the next-level address element and the next node element is less than the address level loss degree, and the address loss degree of the next node element is determined according to the address level loss degree; The similarity between the next-level address element and the next node element is greater than the address level loss, and the address loss of the next node element is determined according to the similarity between the next-level address element and the next node element.

7. The method for determining a standard address according to claim 4, characterized in that: Also includes: If the address loss degree of each of the next node elements does not satisfy a preset numerical condition, each of the next node elements is determined as the end point address element.

8. The method for determining a standard address according to claim 1, characterized in that: Determining the to-be-matched standard address corresponding to each of the destination address elements in the standard address tree includes: Reverse root search is performed on each of the end point address elements in the standard address tree to determine the complete address link corresponding to each of the end point address elements; The complete address link corresponding to each of the destination address elements is determined as the to-be-matched standard address corresponding to each of the destination address elements.

9. The method for determining a standard address according to claim 8, characterized in that: Determining a standard address corresponding to the address to be matched among the standard addresses to be matched includes: The similarity between each of the to-be-matched standard addresses and the to-be-matched address is determined, and the to-be-matched standard address corresponding to the maximum similarity is determined as the standard address corresponding to the to-be-matched address.

10. A standard address determination device, characterized in that: include: A first determination module is used to determine multiple levels of address elements and a central address element corresponding to the address to be matched, and determine a target node element from the highest node element that matches the highest level address element of the address to be matched in the standard address tree; A second determination module, configured to determine, in the standard address tree, a next node element that matches the next level address element of the address to be matched according to the target node element, and determine a next target node element in the next node element; An updating module, configured to update the target node element based on the next target node element, return to execute the next node element that matches the next level address element of the address to be matched in the standard address tree according to the target node element, until the level of the next level address element is lower than the level of the central address element, and determine the next target node element as the end point address element; The execution module is used to determine the to-be-matched standard address corresponding to each of the end point address elements in the standard address tree, and determine the standard address corresponding to the to-be-matched address in the to-be-matched standard addresses.

11. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the standard address determination method according to any one of claims 1 to 9 is implemented.

12. A storage medium containing computer executable instructions, characterized in that: The computer executable instructions are used to perform the standard address determination method as claimed in any one of claims 1 to 9 when executed by a computer processor.

Images