Address resolution method and device, electronic equipment and storage medium

Abstract

The invention discloses an address resolution method and device, electronic equipment and a storage medium. The method comprises the steps of obtaining a to-be-analyzed address, and analyzing the to-be-analyzed address based on a word tree in an eight-level address library to obtain a target word; the word tree is used for describing the relationship between words and words in the eight-level address; the target words are connected in series according to the positions of the target words in the to-be-analyzed addresses, and an eight-level address sequence corresponding to at least one to-be-analyzed address is formed; and determining target sequence weights of the eight-level address sequences, and taking the eight-level address sequence with the highest target sequence weight as a target eight-level address corresponding to the to-be-analyzed address. According to the embodiment of the invention, accurate and efficient address resolution is realized.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to an address resolution method, device, electronic device and storage medium. Background Art

[0002] In the express delivery scenario, the current express delivery business volume is increasing, so accurate address resolution is very important. The current address resolution solution in the express delivery scenario mainly uses the named entity recognition method to identify the entity content appearing in the text and automatically fill it into the corresponding entry of the detailed address. However, due to the complexity and diversity of the address, the above method takes a lot of time to parse, and it is difficult to quickly and accurately parse the specific detailed location from the irregular information filled in. Summary of the invention

[0003] The present invention provides an address resolution method, device, electronic device and storage medium to achieve accurate and efficient address resolution.

[0004] According to one aspect of the present invention, there is provided an address resolution method, the method comprising:

[0005] Obtaining an address to be resolved, and resolving the address to be resolved based on a character tree in an eight-level address library to obtain a target word; the character tree is used to describe the relationship between characters and words in the eight-level address;

[0006] According to the position of the target word in the address to be resolved, the target words are connected in series to form at least one eight-level address sequence corresponding to the address to be resolved;

[0007] The target sequence weights of the eight-level address sequences are determined, and the eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved.

[0008] According to another aspect of the present invention, there is provided an address resolution device, the device comprising:

[0009] A parsing module, used to obtain an address to be parsed, parse the address to be parsed based on a word tree in an eight-level address library, and obtain a target word; the word tree is used to describe the relationship between characters and words in the eight-level address;

[0010] An address sequence determination module, configured to connect the target words in series according to the positions of the target words in the address to be resolved, so as to form at least one eight-level address sequence corresponding to the address to be resolved;

[0011] The eight-level address determination module is used to determine the target sequence weight of the eight-level address sequence, and use the eight-level address sequence with the highest target sequence weight as the target eight-level address corresponding to the address to be resolved.

[0012] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:

[0013] at least one processor; and

[0014] a memory communicatively connected to the at least one processor; wherein,

[0015] The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can perform the address resolution method described in any embodiment of the present invention.

[0016] According to another aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the address resolution method described in any embodiment of the present invention when executed.

[0017] The technical solution of the embodiment of the present invention obtains the address to be resolved, and resolves the address to be resolved based on the word tree in the eight-level address library to obtain the target word; the word tree is used to describe the relationship between the characters and words in the eight-level address; it realizes accurate resolution of words at different levels to avoid information explosion in the retrieval process. Further, according to the position of the target word in the address to be resolved, the target words are connected in series to form an eight-level address sequence corresponding to at least one address to be resolved; then the target sequence weight of the eight-level address sequence is determined, and the eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved, thereby realizing accurate and efficient resolution of the address.

[0018] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0020] Figure 1 is a flow chart of an address resolution method provided according to an embodiment of the present invention;

[0021] Figure 2 is an example diagram of a word tree applicable to an embodiment of the present invention;

[0022] Figure 3is an example diagram of a word tree applicable to an embodiment of the present invention;

[0023] Figure 4 is a flowchart of another address resolution method provided according to an embodiment of the present invention;

[0024] Figure 5 is a flowchart of another address resolution method provided according to an embodiment of the present invention;

[0025] Figure 6 is a schematic diagram of the structure of an address resolution device provided according to an embodiment of the present invention;

[0026] Figure 7 It is a schematic diagram of the structure of an electronic device implementing the address resolution method of the embodiment of the present invention provided according to the embodiment of the present invention. DETAILED DESCRIPTION

[0027] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0028] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0029] Embodiment 1

[0030] Figure 1 The flowchart of an address resolution method provided by an embodiment of the present invention is applicable to the case where the address to be resolved is resolved as an eight-level address. The method can be executed by an address resolution device, which can be implemented in the form of hardware and / or software. The address resolution device can be configured in any electronic device with network communication function. Figure 1 As shown, the address resolution method of the present invention includes the following process:

[0031] S110, obtaining an address to be resolved, and resolving the address to be resolved based on a character tree in the eight-level address library to obtain a target word; the character tree is used to describe the relationship between characters and words in the eight-level address.

[0032] Among them, the eight-level address database can be understood as an information database that stores eight-level addresses. The eight-level address is composed of the standard five-level address information and the last three-level address information. The standard five-level address information is a five-level address composed of provinces / municipalities, cities, districts / counties, towns and villages. The last three-level address information is the last three-level address composed of roads, road numbers and POIs corresponding to the standard five-level address information.

[0033] The specific process of constructing the eight-level address database is as follows: obtain standard five-level address information and the last three levels of address information. For example, the standard five-level address information can be directly obtained from the website of the National Bureau of Statistics, and the five-level address + keyword + pattern matching method is further used to extract the last three levels of address information, namely roads, road numbers, and POIs, from a large number of recipient addresses. The standard five-level address information and the last three levels of address information are further concatenated to form an eight-level address, and the eight-level address is saved in the eight-level address database; the eight-level address in the eight-level address database is saved in the form of a character tree and a word tree. The character tree is used to describe the relationship between characters and words in the eight-level address, and the word tree is used to describe the hierarchical relationship between words in the eight-level address. For example, the exemplary structure of the word tree can be found in Figure 2 , Figure 2 The word tree is formed by the following three eight-level addresses: Shanghai (province) city district (city) Qingpu District (district), Shanghai (province) city district (city) Huangpu District (district), Shanghai (province) city district (city) Minhang District (district). The exemplary structure of the word tree can be found in Figure 3 , Figure 3 It is a character tree formed by the following eight-level address: Qingpu District (District) Huaxin Town (Town).

[0034] Specifically, the address to be resolved is resolved based on the word tree in the eight-level address library to obtain the target word, including: traversing from the first word in the address to be resolved until the last word in the address to be resolved is traversed to obtain the target word. Further, the traversal step length can be set, and based on the word tree in the eight-level address library, a preset number of traversals are performed in sequence starting from the first word in the address to be resolved in units of the step length to obtain the target word. The preset number of rounds can be determined based on the number of words in the address to be resolved, and can be the same as the number of words, or a preset number of words less than the number of words in the address to be resolved can be set as the preset number of rounds.

[0035] For example, if the step size is set to 10 words, the first round of traversal is to traverse the first to the tenth word in the address to be parsed according to the word tree to obtain the target word. The next round is to traverse the second to the eleventh word in the address to be parsed according to the word tree to obtain the target word, and this process continues until the preset rounds of traversal are completed and all target words are obtained.

[0036] S120 . According to the positions of the target words in the address to be resolved, the target words are connected in series to form an eight-level address sequence corresponding to at least one address to be resolved.

[0037] Specifically, during the parsing process, according to the writing order of the address to be parsed, there may be multiple words for each word, because some words corresponding to the address information may have aliases, so this information needs to be traversed to ensure that the eight-level address sequence formed by stringing the target words together is accurate. That is, the target words can be strung together according to the position of the first character of the target word in the address to be parsed to form at least one eight-level address sequence corresponding to the address to be parsed. Taking the address of Huaxin Town, Qingpu District as an example, two eight-level address sequences can be formed, Sequence 1, Qingpu District (district, full name) Huaxin Town (town, full name). Sequence 2: Qingpu District (district, full name) Huaxin (town, alias) Town (none, none).

[0038] S130 , determining a target sequence weight of the eight-level address sequence, and taking the eight-level address sequence with the highest target sequence weight as the target eight-level address corresponding to the address to be resolved.

[0039] The target sequence weight can be understood as the credibility of the eight-level address sequence for the address to be resolved, that is, it can be understood as the accuracy of the eight-level address formed after resolving the address to be resolved.

[0040] Specifically, there may be multiple target words in the same position corresponding to the address to be resolved, and the multiple target words corresponding to the same position will have different corresponding weights. If the target word is consistent with the word tree retrieval, the weight is the highest. If it is an alias, the weight is relatively low. Therefore, the weights of target words of different properties can be pre-set, so as to evaluate the weight of each target word contained in the eight-level address sequence, and further add the weight of each target word contained in the eight-level address sequence as the target sequence weight of the eight-level address sequence. The eight-level address sequence with the highest target sequence weight is further used as the target eight-level address corresponding to the address to be resolved.

[0041] The technical solution of the embodiment of the present invention obtains the address to be resolved, and resolves the address to be resolved based on the word tree in the eight-level address library to obtain the target word; the word tree is used to describe the relationship between the characters and words in the eight-level address; it realizes accurate resolution of words at different levels to avoid information explosion in the retrieval process. Further, according to the position of the target word in the address to be resolved, the target words are connected in series to form an eight-level address sequence corresponding to at least one address to be resolved; then the target sequence weight of the eight-level address sequence is determined, and the eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved, thereby realizing accurate and efficient resolution of the address.

[0042] Embodiment 2

[0043] Figure 4 A flowchart of another address resolution method provided by an embodiment of the present invention. The technical solution of this embodiment further optimizes the process of resolving the address to be resolved based on the word tree in the eight-level address library to obtain the target word and determining the target sequence weight of the eight-level address sequence in the above embodiment. This embodiment can be combined with various optional solutions in one or more of the above embodiments. Figure 4 As shown, the address resolution method of the present invention includes the following process:

[0044] S210, obtaining the address to be parsed, and determining the target word corresponding to the current round of traversal.

[0045] The target word can be understood as the first word traversed at the beginning of the current round.

[0046] Specifically, the target word of the first round is the first word of the address to be resolved, the target word of the second round is the second word of the address to be resolved, and so on.

[0047] S220, determining whether the first word connected to the root node in the word tree in the eight-level address library matches the target word.

[0048] The word tree is composed of a root node, a word, and the corresponding word. The first word of the word is derived from the root node, and each word of the word is connected in sequence along the first word of the word. The last word of the word is connected to the word to construct a word tree. For an example, you can refer to Figure 3 An exemplary structure of a word tree is shown.

[0049] Specifically, there may be multiple word trees in the eight-level address library. The target word is matched with the first word connected to the root node in each word tree in the eight-level address library to determine whether there is a word tree matching the target word for the first word connected to the root node in the word tree, so that the word tree matching the target word can be further used to traverse the address to be parsed to determine the target word.

[0050] In this embodiment, optionally, the word tree includes a reference word tree constructed based on an alias association library, and the alias association library is used to record the correspondence between words and their corresponding aliases; accordingly, the address to be resolved is parsed based on the word tree in the eight-level address library to obtain the target word, including: using the target word obtained based on the reference word tree as the first reference word.

[0051] Specifically, determine whether the first word connected to the root node in the reference word tree in the eight-level address library matches the target word. If it matches, use the word in the reference word tree that matches the target word as the reference word, and continue to determine whether the next word of the target word matches the next word of the reference word. If it matches, continue to determine whether the next word of the target word matches the next word of the reference word, until it does not match, and the matching words in the reference word tree are combined into the target word. If it does not match, use the next word of the target word in the address to be resolved as the target word for the next round of traversal.

[0052] The technical solution of this embodiment obtains target words by parsing the address to be parsed based on the reference word tree in the eight-level address library, thereby ensuring the diversity and richness of the obtained target words and further improving the accuracy of the subsequent eight-level address sequence corresponding to the address to be parsed based on the target words.

[0053] S230. If there is a match, the character in the character tree that matches the target character is used as a reference character, and it is continued to be determined whether the next character of the target character matches the next character of the reference character. If there is a match, it is continued to be determined whether the next next character of the target character matches the next next character of the reference character, until there is no match, and the matching characters in the character tree are combined into a target word.

[0054] For example, Figure 3 Taking the address to be parsed as Qingpu District (District) Huaxin Town (Town) as an example, the target word of the first round is Qing, then Qing is matched with the first word connected to the root node in the word tree in the eight-level address library. If the match is successful, the reference word is "Qing" connected to the root node in the word number. Next, "Pu" in the address to be parsed is matched with the next word of the reference word, and "Pu" is matched, and the matches are made in sequence until "Hua" in the address to be parsed is matched with the corresponding word number. If it is found that there is no match, the traversal of the current round is stopped, and the matched three words "Qing", "Pu" and "District" are combined into the target word "Qingpu District (District)", and the next word of the target word in the address to be parsed in the current round is used as the target word of the next round to enter the next round of traversal.

[0055] S240: If there is no match, the next word of the target word in the address to be resolved is used as the target word to perform the next round of traversal.

[0056] Specifically, if the first word connected to the root node in the word tree in the eight-level address library does not match the target word, the next word of the target word in the address to be resolved is used as the target word for the next round of traversal until the traversal reaches the last word in the address to be resolved.

[0057] In this embodiment, optionally, the eight-level address library includes a generalized character matching library, which is used to describe the association relationship between characters and the generalized characters corresponding to the characters; wherein the generalized characters can be collected from online statistics and based on actual conditions, and can mainly include polyphones, similar characters, Arabic and Chinese characters of numbers, and the like.

[0058] Further, the target word corresponding to the current round of traversal is determined, and whether the first word connected to the root node in the word tree in the eight-level address library matches the target word, including: if the first word connected to the root node in the word tree in the eight-level address library does not match the target word, then determining whether there is a target generalized word for the target word according to the generalized word matching library; if there is, then using the target word obtained by parsing the address to be parsed according to the target generalized word as the second reference word; if there is no target generalized word matching the target word in the generalized word matching library, then using the next word of the target word in the address to be parsed as the target word to perform the next round of traversal.

[0059] Further, the target word obtained by parsing the address to be parsed according to the target generalized word as the second reference word includes determining whether the first word connected to the root node in the word tree in the eight-level address library matches the target generalized word, if it matches, taking the word matching the target generalized word in the word tree as the reference word, continuing to determine whether the next word of the target word matches the next word of the reference word, if it matches, continuing to determine whether the next next word of the target word matches the next next word of the reference word, until they do not match, and forming the matching words in the word tree into the target word. If the first word connected to the root node in the word tree in the eight-level address library does not match the target generalized word, taking the next word of the target word in the address to be parsed as the target word for the next round of traversal.

[0060] According to the technical solution of this embodiment, if the first character connected to the root node in the character tree in the eight-level address library does not match the target character, it is further determined whether there is a target generalized character in the target character according to the generalized character matching library. When it is determined that there is a target generalized character in the target character, the target word obtained by parsing the address to be resolved according to the target generalized character is used as the second reference word, thereby ensuring the diversity and richness of the target words obtained, and further improving the accuracy of the subsequent eight-level address sequence corresponding to the address to be resolved formed according to the target word.

[0061] S250. According to the position of the target word in the address to be resolved, the target words are connected in series to form at least one eight-level address sequence corresponding to the address to be resolved, the target sequence weight of the eight-level address sequence is determined, and the eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved.

[0062] The technical solution of the embodiment of the present invention obtains the address to be resolved, determines the target word corresponding to the current round of traversal, determines whether the first word connected to the root node in the word tree in the eight-level address library matches the target word, so as to quickly and accurately determine the target word according to whether it matches, that is, if it matches, the word matching the target word in the word tree is used as the reference word, and continues to determine whether the next word of the target word matches the next word of the reference word. If it matches, continue to determine whether the next word of the target word matches the next word of the reference word, until it does not match, and the matching words in the word tree are grouped into the target word. If the first word connected to the root node in the word tree in the eight-level address library does not match the target word, the next word of the target word in the address to be resolved is used as the target word to perform the next round of word traversal. Further, according to the position of the target word in the address to be resolved, the target words are connected in series to form an eight-level address sequence corresponding to at least one address to be resolved, and the target sequence weight of the eight-level address sequence is determined. The eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved, so as to achieve accurate and efficient resolution of the address.

[0063] Embodiment 3

[0064] Figure 5 This is a flowchart of another address resolution method provided by an embodiment of the present invention. The technical solution of this embodiment further optimizes the process of determining the target sequence weight of the eight-level address sequence in the above embodiment. This embodiment can be combined with various optional solutions in one or more of the above embodiments. Figure 5 As shown, the address resolution method of the present invention includes the following process:

[0065] S310, obtaining the address to be resolved, resolving the address to be resolved based on the character tree in the eight-level address library to obtain the target word, and connecting the target words in series according to the position of the target word in the address to be resolved to form an eight-level address sequence corresponding to at least one address to be resolved; the character tree is used to describe the relationship between characters and words in the eight-level address.

[0066] S320, determining the word type of each target word in the eight-level address sequence, and determining the reference weight value of the target word according to the word type of the target word, and there is a corresponding relationship between the word type and the reference weight value.

[0067] The word type of the target word can be determined according to a method for obtaining the target word.

[0068] Specifically, if it is determined that the first word connected to the root node in the word tree in the eight-level address library matches the target word, and the word in the word tree that matches the target word is used as the reference word, continue to determine whether the next word of the target word matches the next word of the reference word. If they match, continue to determine whether the next-next word of the target word matches the next-next word of the reference word, until they do not match, and the matching words in the word tree are combined into a target word. The target word determined in this way is the first reference type.

[0069] If the target word obtained based on the reference word tree is used as the first reference word, the target word determined in this way is of the second reference type.

[0070] If the first word connected to the root node in the word tree in the eight-level address library does not match the target word, it is determined according to the generalized word matching library whether there is a target generalized word for the target word; if so, the target word obtained by parsing the address to be resolved according to the target generalized word is used as the second reference word. The target word determined in this way is the third reference type.

[0071] If it is detected during the process of traversing the address to be resolved that there is a target word between two target words that cannot be matched with any word tree in the eight-level address library, the word type of the target word is the fourth reference type.

[0072] Furthermore, the target words of the first reference type, the second reference type, the third reference type, and the fourth reference type respectively correspond to the reference weight values ​​of the words, and the reference weight value of the target word of the first reference type > the reference weight value of the target word of the second reference type > the reference weight value of the target word of the third reference type > the reference weight value of the target word of the fourth reference type.

[0073] For example, the reference weight value of the target word of the first reference type can be set to 10, the reference weight value of the target word of the second reference type can be set to 9, the reference weight value of the target word of the third reference type can be set to 8, and the reference weight value of the target word of the fourth reference type can be set to 1. Thus, the word type of each target word in the eight-level address sequence is determined, and the reference weight value of each target word is determined according to the word type of the target word.

[0074] Furthermore, the length of the target word is the number of characters included in the target word, and the reference weight value of the target word may be updated by multiplying the reference weight value of the target word by the length of the target word.

[0075] For all eight-level address sequences corresponding to the addresses to be resolved, if the reference weight value of each target word is determined according to the word type of the target word, then the reference weight values ​​of all target words are determined by determining the reference weight value of each target word according to the word type of the target word; if the reference weight value of the target word is multiplied by the length of the target word to update the reference weight value of the target word, then the final reference weight values ​​of all target words are determined by multiplying the reference weight value of the target word by the length of the target word.

[0076] S330, determining the parent word of the target word in the eight-level address sequence, and the reference distance between the target word and the parent word; the reference distance is the number of words between the target word and the parent word.

[0077] Specifically, the parent word of the target word in the eight-level address sequence can be determined according to the word tree in the eight-level address library.

[0078] S340: Obtain the parent weight of the parent word, and determine the inheritance weight of the target word according to the parent weight and the reference distance.

[0079] Specifically, the parent weight of the parent word can be determined according to the word type of the parent word. In fact, the parent word is the target word before the current target word, so the parent weight of the parent word has been determined before and can be directly obtained, that is, the reference weight value corresponding to the word type of the parent word can be directly used as the parent weight, or the reference weight value of the parent word multiplied by the length of the parent word can be used as the parent weight.

[0080] S350. The sum of the inherited weight and the reference weight value of the target word is used as the target weight of the target word, the target weights of each target word in the eight-level address sequence are added together as the target sequence weight of the eight-level address sequence, and the eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved.

[0081] The technical solution of the embodiment of the present invention is to obtain the address to be resolved, resolve the address to be resolved based on the word tree in the eight-level address library to obtain the target word, and connect the target words in series according to the position of the target word in the address to be resolved to form at least one eight-level address sequence corresponding to the address to be resolved; further determine the word type of each target word in the eight-level address sequence, and determine the reference weight value of the target word according to the word type of the target word. Because there is a corresponding relationship between the word type and the reference weight value, it is possible to quickly and accurately determine the weight of each target word, and at the same time determine the parent word of the target word in the eight-level address sequence, as well as the reference distance of the target word from the parent word; obtain the parent weight of the parent word, and determine the inherited weight of the target word according to the parent weight and the reference distance, so that the sum of the inherited weight of the target word and the reference weight value is used as the target weight of the target word. The inherited weight and the reference weight value are used to calculate the target weight of the target word, which can ensure the accuracy of the target weight of the target word and avoid errors in the selection of the target eight-level address due to errors in the target weight of the target word. Finally, the target weights of each target word in the eight-level address sequence are added together as the target sequence weight of the eight-level address sequence, and the eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved, thereby achieving accurate and efficient address resolution.

[0082] Embodiment 4

[0083] Figure 6 The present invention provides a schematic diagram of the structure of an address resolution device. This embodiment is applicable to the case where the address to be resolved is resolved into an eight-level address. The address resolution device can be implemented in the form of hardware and / or software. The address resolution device can be configured in any electronic device with network communication function. Figure 6 As shown, the address resolution device of the present invention comprises:

[0084] The parsing module 410 is used to obtain an address to be parsed, and parse the address to be parsed based on a character tree in the eight-level address library to obtain a target word; the character tree is used to describe the relationship between characters and words in the eight-level address;

[0085] An address sequence determination module 420, configured to connect the target words in series according to the positions of the target words in the address to be resolved, so as to form at least one eight-level address sequence corresponding to the address to be resolved;

[0086] The eight-level address determination module 430 is used to determine the target sequence weight of the eight-level address sequence, and use the eight-level address sequence with the highest target sequence weight as the target eight-level address corresponding to the address to be resolved.

[0087] On the basis of the above embodiment, optionally, the address resolution device includes an address library construction module, which is used to obtain standard five-level address information and last three-level address information; the standard five-level address information is a five-level address composed of province / municipality, city, district / county, town and village, and the last three-level address information is a last three-level address composed of road, road number and POI corresponding to the standard five-level address information; the standard five-level address information and the last three-level address information are spliced ​​to form an eight-level address, and the eight-level address is stored in the eight-level address library; the eight-level address in the eight-level address library is stored in the form of a character tree and a word tree, the character tree is used to describe the relationship between characters and words in the eight-level address, and the word tree is used to describe the superior-subordinate relationship between words in the eight-level address.

[0088] On the basis of the above embodiment, optionally, the parsing module is used to traverse from the first word in the address to be parsed until traversing to the last word in the address to be parsed to obtain the target word.

[0089] Based on the above embodiment, optionally, the word tree is composed of a root node, a word and a word corresponding to the word; the first word of the word is derived from the root node, each word of the word is connected in sequence along the first word of the word, and the last word of the word is connected to the word to construct the word tree;

[0090] Correspondingly, the parsing module includes a matching judgment unit, a first judgment unit and a second judgment unit; the matching judgment unit is used to determine the target word corresponding to the current round of traversal, and determine whether the first word connected to the root node in the word tree in the eight-level address library matches the target word; the first judgment unit is used to, if there is a match, use the word in the word tree that matches the target word as a reference word, and continue to determine whether the next word of the target word matches the next word of the reference word, and if there is a match, continue to determine whether the next next word of the target word matches the next next word of the reference word, until there is no match, and the matching words in the word tree are grouped into target words; the second judgment unit is used to, if there is no match, use the next word of the target word in the address to be parsed as the target word to perform the next round of word traversal.

[0091] Based on the above embodiment, optionally, the word tree includes a reference word tree constructed based on an alias association library, and the alias association library is used to record the correspondence between words and their corresponding aliases; accordingly, the parsing module includes a first reference word determination unit, and the first reference word determination unit is used to use the target word obtained based on the reference word tree as the first reference word.

[0092] Based on the above embodiment, optionally, the eight-level address library includes a generalized word matching library, and the generalized word matching library is used to describe the association relationship between the word and the generalized word corresponding to the word;

[0093] Correspondingly, the matching judgment unit is also used to determine whether there is a target generalized word for the target word according to the generalized word matching library if the first word connected to the root node in the word tree in the eight-level address library does not match the target word; if so, the target word obtained by parsing the address to be resolved according to the target generalized word is used as the second reference word.

[0094] On the basis of the above embodiment, optionally, an eight-level address determination module is used to determine the word type of each target word in the eight-level address sequence, determine the reference weight value of the target word according to the word type of the target word, and there is a corresponding relationship between the word type and the reference weight value; determine the parent word of the target word in the eight-level address sequence, and the reference distance of the target word from the parent word; the reference distance is the number of words between the target word and the parent word; obtain the parent weight of the parent word, and determine the inherited weight of the target word according to the parent weight and the reference distance; take the sum of the inherited weight of the target word and the reference weight value as the target weight of the target word; add the target weights of each target word in the eight-level address sequence as the target sequence weight of the eight-level address sequence.

[0095] The address resolution device provided in the embodiment of the present invention can execute the address resolution method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0096] Embodiment 4

[0097] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

[0098] Figure 7 A schematic diagram of the structure of an electronic device that can be used to implement the address resolution method of an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0099] like Figure 7As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0100] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0101] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as an address resolution method.

[0102] In some embodiments, the address resolution method may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the address resolution method described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the address resolution method in any other appropriate manner (e.g., by means of firmware).

[0103] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0104] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0105] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, 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 foregoing.

[0106] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0107] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0108] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0109] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0110] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. An address resolution method, characterized in that: The method comprises: Obtaining an address to be resolved, and resolving the address to be resolved based on a character tree in an eight-level address library to obtain a target word; the character tree is used to describe the relationship between characters and words in the eight-level address; According to the position of the target word in the address to be resolved, the target words are connected in series to form at least one eight-level address sequence corresponding to the address to be resolved; The target sequence weights of the eight-level address sequences are determined, and the eight-level address sequence with the highest target sequence weight is used as the target eight-level address corresponding to the address to be resolved.

2. The method according to claim 1, characterized in that The method further comprises: Obtaining standard five-level address information and last three-level address information; the standard five-level address information is a five-level address consisting of province / municipality, city, district / county, town and village, and the last three-level address information is a last three-level address consisting of road, road number and POI corresponding to the standard five-level address information; The standard five-level address information and the last three-level address information are spliced ​​to form an eight-level address, and the eight-level address is stored in the eight-level address library; the eight-level address in the eight-level address library is stored in the form of a character tree and a word tree, the character tree is used to describe the relationship between characters and words in the eight-level address, and the word tree is used to describe the superior-subordinate relationship between words in the eight-level address.

3. The method according to claim 1, characterized in that Parsing the address to be parsed based on the word tree in the eight-level address library to obtain the target word includes: The target word is obtained by traversing from the first word in the address to be resolved until the last word in the address to be resolved is reached.

4. The method according to claim 3, characterized in that: The word tree is composed of a root node, a word and a word corresponding to the word; the first word of the word is derived from the root node, each word of the word is connected in sequence along the first word of the word, and the last word of the word is connected to the word to construct the word tree; Accordingly, traversing from the first word in the address to be resolved until traversing to the last word in the address to be resolved to obtain the target word includes: Determine the target word corresponding to the current round of traversal, and determine whether the first word connected to the root node in the word tree in the eight-level address library matches the target word; If they match, the character in the character tree that matches the target character is used as a reference character, and whether the next character of the target character matches the next character of the reference character is determined. If they match, whether the next character of the target character matches the next character of the reference character is determined. Until they do not match, the matching characters in the character tree are combined into a target word. If there is no match, the next word of the target word in the address to be resolved is used as the target word to perform the next round of traversal.

5. The method according to claim 4, characterized in that The word tree includes a reference word tree constructed based on an alias association library, wherein the alias association library is used to record the correspondence between a word and an alias corresponding to the word; Correspondingly, the address to be resolved is parsed based on the word tree in the eight-level address library to obtain a target word, including: using the target word obtained based on the reference word tree as a first reference word.

6. The method according to claim 4, characterized in that The eight-level address library includes a generalized word matching library, and the generalized word matching library is used to describe the association relationship between a word and a generalized word corresponding to the word; Accordingly, determining whether the first word connected to the root node in the word tree in the eight-level address library matches the target word includes: If the first word connected to the root node in the word tree in the eight-level address library does not match the target word, determining whether there is a target generalized word for the target word according to the generalized word matching library; If so, a target word obtained by parsing the address to be resolved according to the target generalized word is used as the second reference word.

7. The method according to claim 1, characterized in that Determining a target sequence weight of the eight-level address sequence includes: Determine the word type of each of the target words in the eight-level address sequence, and determine the reference weight value of the target word according to the word type of the target word, and there is a corresponding relationship between the word type and the reference weight value; Determine the parent word of the target word in the eight-level address sequence, and a reference distance between the target word and the parent word; the reference distance is the number of words between the target word and the parent word; Acquire the parent weight of the parent word, and determine the inheritance weight of the target word according to the parent weight and the reference distance; The sum of the inherited weight of the target word and the reference weight value is used as the target weight of the target word; The target weights of each target word in the eight-level address sequence are added together as the target sequence weight of the eight-level address sequence.

8. An address resolution device, characterized in that: The device comprises: A parsing module, used to obtain an address to be parsed, parse the address to be parsed based on a word tree in an eight-level address library, and obtain a target word; the word tree is used to describe the relationship between characters and words in the eight-level address; An address sequence determination module, configured to connect the target words in series according to the positions of the target words in the address to be resolved, so as to form at least one eight-level address sequence corresponding to the address to be resolved; The eight-level address determination module is used to determine the target sequence weight of the eight-level address sequence, and use the eight-level address sequence with the highest target sequence weight as the target eight-level address corresponding to the address to be resolved.

9. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can perform the address resolution method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the address resolution method according to any one of claims 1 to 7 when executed.

Images