Address matching method and device, server, storage medium and program product
By utilizing precise and similarity matching of cell names in address matching, the inefficiency of existing technologies is solved, achieving a highly efficient address matching process, especially when the number of cell addresses is large, significantly improving the matching speed.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-29
- Publication Date
- 2026-03-31
AI Technical Summary
Existing technologies are inefficient when performing address matching, especially when matching social addresses with original addresses, and require a large amount of text matching computation, particularly when the number of social addresses is large.
Precise matching is performed using the community name. If the same community name exists in the geographic information database and is within a preset distance threshold, a match is determined. If no matching community name is found, similarity matching is performed based on the similarity value and the distance threshold to narrow down the filtering range. The final matching address is determined using the comprehensive similarity value.
It improves the efficiency of address matching by combining precise and similarity matching, reducing the number of social addresses to be matched and increasing the matching speed.
Smart Images

Figure CN121765388A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of data processing technology, and in particular to an address matching method, apparatus, server, storage medium, and program product. Background Technology
[0002] Manually created original addresses may be edited by multiple people at different times, and there is no unified editing standard. Therefore, the same original address may include multiple different descriptions. Social addresses, on the other hand, are addresses with unified writing rules and can be referenced. When it is necessary to determine whether a certain original address has corresponding resource information, the first step is to find the social addresses related to that original address. Then, by matching the social addresses with the original addresses, the resource information related to that original address can be obtained.
[0003] Currently, existing technologies generally achieve matching between original addresses and social addresses by matching keywords in the original address one-to-one with the social address.
[0004] However, if the number of social addresses to be matched is large, a lot of text matching calculations are required, resulting in low matching efficiency. Summary of the Invention
[0005] This application provides an address matching method, apparatus, server, storage medium, and program product to improve matching efficiency.
[0006] In a first aspect, embodiments of this application provide an address matching method, comprising: receiving an original address sent by a user terminal; wherein the original address includes a cell name; determining whether a social address with the same cell name exists in a geographic information database; wherein multiple social addresses exist in the geographic information database; if it is determined that a social address with the same cell name exists in the geographic information database, and the distance between the social address with the same cell name and the original address is within a preset distance threshold, then the social address with the same cell name is determined as the social address matching the original address; if it is determined that no social address with the same cell name exists in the geographic information database, then the social address with the highest similarity value to the original address is obtained based on the original address and the geographic information database; determining whether the distance between the social address with the highest similarity value and the original address is within a preset distance threshold; if the distance is not within the preset distance threshold, then a filtering range is determined with the original address as the center point and the preset distance threshold as the radius; obtaining all social addresses within the filtering range from the geographic information database, and determining the comprehensive similarity value between each social address and the original address; and determining the social address matching the original address from all social addresses based on the comprehensive similarity value.
[0007] In one possible implementation, the social address with the highest similarity value to the original address is obtained based on the original address and a geographic information database. This includes: segmenting the original address into words to obtain multiple sets of address words; matching each set of address words with multiple social addresses in the geographic information database to obtain at least one social address; determining the similarity value of at least one social address according to the proportion of preset keywords; and obtaining the social address with the highest similarity value to the original address based on the similarity value of at least one social address.
[0008] In one possible implementation, determining the overall similarity value between each social address and the original address includes: obtaining the number similarity value between each social address and the original address; obtaining the weight similarity value between each social address and the original address; and determining the overall similarity value between each social address and the original address based on the number similarity value and the weight similarity value.
[0009] In one possible implementation, obtaining the number similarity value between each social address and the original address includes: determining the number similarity value of each social address based on the number of characters in each social address and the number of characters that are the same in each social address and the original address; determining the number similarity value of the original address based on the number of characters in the original address and the number of characters that are the same in each social address and the original address; and obtaining the number similarity value between each social address and the original address based on the number similarity value of each social address and the number similarity value of the original address.
[0010] In one possible implementation, obtaining the weighted similarity value between each social address and the original address includes: determining the weighted similarity value of each social address based on the character weight of the same characters in each social address and the original address; determining the weighted similarity value of the original address based on the character weight of the same characters in the original address and each social address; and obtaining the weighted similarity value between each social address and the original address based on the weighted similarity value of each social address and the weighted similarity value of the original address.
[0011] In one possible implementation, after determining whether the distance between the social address with the highest similarity value and the original address is within a preset distance threshold, the method further includes: if the distance is within the preset distance threshold, then the social address with the highest similarity value is determined as the social address that matches the original address.
[0012] Secondly, embodiments of this application provide an address matching device, comprising:
[0013] The receiving module is used to receive the raw address sent by the user terminal; the raw address includes the cell name.
[0014] The first judgment module is used to determine whether there is a social address in the geographic information database that has the same name as the community; where there are multiple social addresses in the geographic information database.
[0015] The first determining module is used to determine the social address with the same name as the original address if it is determined that there is a social address with the same name as the community in the geographic information database, and the distance between the social address with the same name and the original address is within a preset distance threshold.
[0016] The acquisition module is used to obtain the social address with the highest similarity value to the original address based on the original address and the geographic information database if it is determined that there is no social address with the same name as the community in the geographic information database.
[0017] The second judgment module is used to determine whether the distance between the social address with the highest similarity value and the original address is within a preset distance threshold.
[0018] The second determining module is used to determine the filtering range with the original address as the center point and the preset distance threshold as the radius if the distance is not within the preset distance threshold.
[0019] The third determination module is used to obtain all social addresses within the filtering range from the geographic information database and determine the comprehensive similarity value between each social address and the original address.
[0020] The fourth determination module is used to determine the social address that matches the original address from all social addresses based on the comprehensive similarity value.
[0021] Thirdly, embodiments of this application provide a server, including: a memory and a processor;
[0022] The memory stores computer-executed instructions;
[0023] The processor executes computer execution instructions stored in the memory, causing the processor to perform the first aspect and / or various possible implementations of the first aspect as described above.
[0024] Fourthly, embodiments of this application provide a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement the first aspect and / or various possible implementations of the first aspect.
[0025] Fifthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the first aspect and / or various possible implementations of the first aspect.
[0026] The address matching method, apparatus, server, storage medium, and program product provided in this application embodiment perform precise matching based on the cell name of the original address. If a social address with the same cell name exists in the geographic information database, and its distance from the original address is within a preset distance threshold, then the social address with the same cell name is considered a matching social address. This precise matching improves matching efficiency. If no social address with the same cell name is found because the original address sent by the user did not accurately include the cell name, then the social address with the highest similarity value to the original address is obtained, and this highest similarity social address is within a preset distance threshold. If no match is found, the filtering range is narrowed, and the social address matching the original address is determined based on the comprehensive similarity value between the social address and the original address. This narrowing of the filtering range reduces the number of social addresses to be matched, further improving matching efficiency. Attached Figure Description
[0027] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.
[0028] Figure 1 A schematic diagram illustrating a scenario for the address matching method provided in an embodiment of this application;
[0029] Figure 2 A flowchart illustrating the address matching method provided in this application embodiment;
[0030] Figure 3 This is a schematic diagram of the address matching device provided in an embodiment of this application;
[0031] Figure 4 This is a schematic diagram of the server structure provided in an embodiment of this application.
[0032] The accompanying drawings illustrate specific embodiments of this application, which will be described in more detail below. These drawings and descriptions are not intended to limit the scope of the concept in any way, but rather to illustrate the concept of this application to those skilled in the art through reference to particular embodiments. Detailed Implementation
[0033] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.
[0034] Manually created original addresses may be edited by multiple people at different times, and there is no unified editing standard. Therefore, the same original address may include multiple different descriptions. Social addresses, on the other hand, are addresses with unified writing rules and can be referenced. When it is necessary to determine whether a certain original address has corresponding resource information, the first step is to find social addresses related to that original address. Then, by matching the social addresses with the original addresses, the resource information related to that original address can be obtained. Currently, existing technologies generally use a one-to-one matching method of keywords in the original address to perform text matching with the social address to achieve matching between the original address and the social address. However, if the number of social addresses to be matched is large, a large amount of text matching calculation is required, resulting in low matching efficiency.
[0035] To address the above technical problems, this application proposes the following technical approach: Precise matching is performed based on the cell name of the original address. If a social address with the same cell name exists in the geographic information database, and its distance from the original address is within a preset distance threshold, then the social address with the same cell name is considered a match for the original address. If no social address with the same cell name is found because the original address sent by the user did not accurately include the cell name, matching is performed based on the similarity value and the preset distance threshold. If no match is found, the number of social addresses to be matched is reduced by filtering the range, and further fuzzy matching is performed based on the comprehensive similarity value.
[0036] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will now be described with reference to the accompanying drawings.
[0037] Figure 1 This is a schematic diagram of a scenario for the address matching method provided in the embodiments of this application, such as... Figure 1 As shown, the specific application scenarios of this application include: user terminal 101, server 102 and resource management terminal 103.
[0038] refer to Figure 1 The user terminal 101 sends the original address entered by the user to the server 102. The server 102 matches the original address with multiple social addresses in the geographic information database, obtains the social address that matches the original address, and sends the matching result to the resource management terminal 103.
[0039] Figure 2 This is a flowchart illustrating the address matching method provided in an embodiment of this application, as shown below. Figure 2 As shown, the method includes:
[0040] S201: Receive the original address sent by the user terminal; the original address includes the cell name.
[0041] Optionally, users can enter the original address on the user terminal through the interface, including information such as province, city, district / county, neighborhood name, detailed street, and house number. The neighborhood name may include aliases or abbreviations.
[0042] The original address includes: province name, city name, district / county name, short name, community name, coordinates, and full name.
[0043] Optionally, if the user sends multiple original addresses at the same time, the multiple original addresses are sorted according to the latest update time of each original address, and each original address is processed in the sorting order.
[0044] S202: Determine whether there is a social address in the geographic information database that has the same name as the community; where there are multiple social addresses in the geographic information database.
[0045] The geographic information database includes a complete set of social addresses. Each social address includes information such as: community name, building name, administrative village name, natural village name, province name, city name, district / county name, alias, and coordinates. Furthermore, these social addresses are standardized and referential addresses compiled according to uniform rules.
[0046] Optionally, if the community name has an alias, it can also be determined whether there is a social address in the geographic information database that has the same alias as the community name.
[0047] S203: If it is determined that there is a social address in the geographic information database with the same name as the community, and the distance between the social address with the same name and the original address is within a preset distance threshold, then the social address with the same name is determined as the social address that matches the original address.
[0048] Optionally, the preset distance threshold can be 2000 meters.
[0049] In this embodiment, a social address with the same cell name as the original address, and within 2000 meters of the original address, is considered a social address that matches the original address.
[0050] S204: If it is determined that there is no social address with the same name as the community in the geographic information database, then obtain the social address with the highest similarity value to the original address based on the original address and the geographic information database.
[0051] Specifically, step S204 includes S2041 to S2044:
[0052] S2041: Segment the original address to obtain multiple sets of address words.
[0053] Specifically, the original address is segmented into multiple address words according to a preset number of characters.
[0054] Optionally, the preset number of characters can be 2.
[0055] S2042: Match each set of address words with multiple social addresses in the geographic information database to obtain at least one social address.
[0056] Specifically, the first set of address terms is matched with multiple social addresses in the geographic information database to obtain the first set of social addresses; the second set of address terms is matched with the first set of social addresses to obtain the second set of social addresses. This process continues until the Nth set of address terms is matched with the (N-1)th set of social addresses to obtain the Nth set of social addresses. The Nth set of social addresses must be at least one social address.
[0057] S2043: Determine the similarity value of at least one social address according to the proportion of preset keywords.
[0058] Optionally, the preset keywords can be the name of the residential community, the name of the building, the name of the administrative village, and the name of the natural village.
[0059] For example, using the cell name as a preset keyword, the proportion of the cell name in each social address in the original address is used as a similarity value to obtain the similarity value between each social address and the original address in at least one social address.
[0060] S2044: Based on the similarity value of at least one social address, obtain the social address with the highest similarity value to the original address.
[0061] Specifically, based on the similarity value, at least one social address is sorted in descending order to obtain the social address with the highest similarity value to the original address.
[0062] S205: Determine whether the distance between the social address with the highest similarity value and the original address is within a preset distance threshold.
[0063] Optionally, the preset distance threshold can be 2000 meters.
[0064] S206: If the distance is not within the preset distance threshold, the filtering range is determined with the original address as the center point and the preset distance threshold as the radius.
[0065] Optionally, if the distance is not within the preset range, steps S2043 and S2044 are executed according to the building name based on the preset keywords. If the distance between the preset keywords and the original address obtained by the building name is also not within the preset distance threshold, steps S2043 and S2044 are executed sequentially according to the administrative village name and natural village name based on the preset keywords, and the distance between the social address with the highest similarity value and the original address is re-determined to be within the preset distance threshold. If neither is within the preset distance threshold, the filtering range is determined with the original address as the center point and the preset distance threshold as the radius.
[0066] Optionally, when the preset keyword is the name of an administrative village, the preset distance threshold is 10,000 meters; when the preset keyword is the name of a natural village, the preset distance threshold is 5,000 meters.
[0067] In this embodiment, if the distance between the social address with the highest similarity value and the original address is not within a preset distance threshold, then the social address with the highest similarity value is not the social address corresponding to the original address.
[0068] In this embodiment, the filtering range is a circular area centered on the original address and with a preset distance threshold as the radius.
[0069] S207: Obtain all social addresses within the filtering range from the geographic information database and determine the comprehensive similarity value between each social address and the original address.
[0070] Specifically, step S207 includes S2071 to S2073:
[0071] S2071: Obtain the number of similarities between each social address and the original address.
[0072] Specifically, step S2071 includes Sa~Sc:
[0073] Sa: Determine the number of similarities for each social address based on the number of characters in each social address and the number of characters that are the same in each social address and the original address.
[0074] Specifically, the formula for determining the similarity value of the number of each social address is:
[0075]
[0076] For example, the original address is "Hospital A Dormitory" and the social address is "Hospital A Family Area". The social address has 6 characters, and the social address and the original address have 3 identical characters. Therefore, the similarity value is 3 / 6.
[0077] Sb: Determine the number of similarity values of the original addresses based on the number of characters in the original address and the number of characters that are the same between the original address and each social address.
[0078] Specifically, the formula for determining the number similarity value of the original address is as follows:
[0079]
[0080] Exemplarily, the original address is the dormitory of Hospital A, and the social address is the family area of Hospital A. The number of characters in the original address is 5, and the number of identical characters between the original address and the social address is 3. Then the number similarity value is 3 / 5.
[0081] Sc: Obtain the number similarity value between each social address and the original address according to the number similarity value of each social address and the number similarity value of the original address.
[0082] Specifically, the formula for the number similarity value between each social address and the original address is as follows:
[0083]
[0084] S2072: Obtain the weight similarity value between each social address and the original address.
[0085] Specifically, step S2072 includes Sd to Sf:
[0086] Sd: Determine the weight similarity value of each social address according to the character weights of the identical characters between each social address and the original address.
[0087] Exemplarily, the original address is the dormitory of Hospital A, and the social address is the family area of Hospital A. The identical characters between the social address and the original address are: "A", "Hospital", and "Institute". The sum of the weights of the three characters "A", "Hospital", and "Institute" in the social address is used as the weight similarity value of this social address.
[0088] Specifically, in the original address and the social address, the weight of each character satisfies the following conditions: The weight of the last character is 1%, and except for the last character, the weights of the remaining characters are linearly decreased and equally distributed.
[0089] Exemplarily, in the social address, the weight of the last character "Area" in the social address is 1%, the weight of the character "A" is 32.33%, the weight of the character "Hospital" is 26.07%, the weight of the character "Institute" is 19.8%, the weight of the character "Family" is 13.53%, and the weight of the character "Belonging" is 7.27%. Then the weight similarity value of the social address is 78.2%.
[0090] Se: Determine the weight similarity value of the original address according to the character weights of the identical characters between the original address and each social address.
[0091] Exemplarily, the original address is the dormitory of Hospital A, and the social address is the family area of Hospital A. The common characters between the original address and the social address are: "A", "医" (Chinese character for "hospital"), and "院" (Chinese character for "hospital"). The sum of the weights of the three characters "A", "医", and "院" in the original address is used as the weight similarity value of the original address.
[0092] Exemplarily, in the original address, the weight of the last character "舍" (Chinese character for "dormitory") in the original address is 1%, the weight of the character "A" is 39%, the weight of the character "医" is 29.5%, the weight of the character "院" is 20%, and the weight of the character "宿" is 10.5%. Then the weight similarity value of the original address is 88.5%.
[0093] Sf: Obtain the weight similarity value between each social address and the original address according to the weight similarity value of each social address and the weight similarity value of the original address.
[0094] Specifically, the formula for the weight similarity value between each social address and the original address is:
[0095]
[0096] S2073: Determine the comprehensive similarity value between each social address and the original address according to the number similarity value and the weight similarity value.
[0097] In this embodiment, the formula for determining the comprehensive similarity value between each social address and the original address is:
[0098]
[0099] S208: Determine the social address that matches the original address from all social addresses according to the comprehensive similarity value.
[0100] In this embodiment, the social address with a comprehensive similarity value greater than the preset comprehensive similarity value threshold is determined as the social address that matches the original address.
[0101] Optionally, the preset comprehensive similarity value threshold can be 70%.
[0102] Optionally, in step S207, the comprehensive similarity value can be determined according to the community name of the social address and the short name of the original address. If the comprehensive similarity value is less than 70%, the comprehensive similarity value is determined according to the building name of the social address and the short name of the original address.
[0103] Optionally, after determining the social address that matches the original address, the matching result is sent to the resource terminal. The matching result includes the social address where the match is successful, the comprehensive similarity value, and the distance between the matching social address and the original address, etc. The resource terminal obtains the resource information of the original address according to the matching result.
[0104] In summary, precise matching based on the community name of the original address is used. If a social address with the same community name exists in the geographic information database and its distance from the original address is within a preset distance threshold, then the social address with the same community name is considered a match for the original address. This precise matching improves matching efficiency. If no social address with the same community name is found due to inaccurate community name input in the original address sent by the user, the social address with the highest similarity value to the original address is selected, provided it is within a preset distance threshold. If no match is found, the filtering range is narrowed. Based on the comprehensive similarity value between the social address and the original address, a social address matching the original address is determined. This narrowing of the filtering range reduces the number of social addresses to be matched, further improving matching efficiency.
[0105] Based on the above embodiments, this embodiment describes the process of handling the distance between the social address with the highest similarity value and the original address within a preset distance threshold, as detailed below:
[0106] If the distance is within the preset distance threshold, the social address with the highest similarity value will be determined as the social address that matches the original address.
[0107] In this embodiment, if the distance between the social address with the highest similarity value and the original address is within a preset distance threshold, then the social address with the highest similarity value is determined as the social address that matches the original address, and steps S206, S207, and S208 are no longer executed.
[0108] In summary, if the distance between the social address with the highest similarity value and the original address is within the preset distance threshold, it means that the social address matches the original address. There is no need to further reduce the filtering range and determine the social address that matches the original address based on the comprehensive similarity value, which further improves the efficiency of address matching.
[0109] Figure 3 This is a schematic diagram of the address matching device provided in the embodiments of this application, as shown below. Figure 4 As shown, the address matching device provided in this embodiment includes: a receiving module 301, a first judging module 302, a first determining module 303, an obtaining module 304, a second judging module 305, a second determining module 306, a third determining module 307, and a fourth determining module 308.
[0110] The receiving module 301 is used to receive the original address sent by the user terminal; wherein the original address includes the cell name.
[0111] The first judgment module 302 is used to determine whether there is a social address in the geographic information database that has the same name as the community; wherein there are multiple social addresses in the geographic information database.
[0112] The first determining module 303 is used to determine the social address with the same name as the original address if it is determined that there is a social address with the same name as the community in the geographic information database, and the distance between the social address with the same name and the original address is within a preset distance threshold.
[0113] The acquisition module 304 is used to obtain the social address with the highest similarity value to the original address based on the original address and the geographic information database if it is determined that there is no social address with the same name as the community in the geographic information database.
[0114] The second judgment module 305 is used to determine whether the distance between the social address with the highest similarity value and the original address is within a preset distance threshold.
[0115] The second determining module 306 is used to determine the filtering range with the original address as the center point and the preset distance threshold as the radius if the distance is not within the preset distance threshold.
[0116] The third determining module 307 is used to obtain all social addresses within the filtering range from the geographic information database and determine the comprehensive similarity value between each social address and the original address.
[0117] The fourth determination module 308 is used to determine the social address that matches the original address from all social addresses based on the comprehensive similarity value.
[0118] In one possible implementation, the acquisition module 304 is specifically used for: segmenting the original address to obtain multiple sets of address words; matching each set of address words with multiple social addresses in the geographic information database to obtain at least one social address; determining the similarity value of at least one social address according to the proportion of preset keywords; and obtaining the social address with the highest similarity value to the original address based on the similarity value of at least one social address.
[0119] In one possible implementation, the third determining module 307 is specifically used to: obtain the number similarity value between each social address and the original address; obtain the weight similarity value between each social address and the original address; and determine the comprehensive similarity value between each social address and the original address based on the number similarity value and the weight similarity value.
[0120] In one possible implementation, the third determining module 307 is further configured to determine the number similarity value of each social address based on the number of characters in each social address and the number of characters that are the same as those in the original address; determine the number similarity value of the original address based on the number of characters in the original address and the number of characters that are the same as those in each social address; and obtain the number similarity value between each social address and the original address based on the number similarity value of each social address and the number similarity value of the original address.
[0121] In one possible implementation, the third determining module 307 is further configured to determine the weight similarity value of each social address based on the character weight of the same characters between each social address and the original address; determine the weight similarity value of the original address based on the character weight of the same characters between the original address and each social address; and obtain the weight similarity value between each social address and the original address based on the weight similarity value of each social address and the weight similarity value of the original address.
[0122] In one possible implementation, the address matching device further includes a fifth determining module, specifically used to determine the social address with the highest similarity value as the social address that matches the original address if the distance is within a preset distance threshold.
[0123] The address matching device provided in this embodiment can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and will not be described in detail here.
[0124] Figure 4 This is a schematic diagram of the server structure provided in an embodiment of this application. Figure 4 As shown, the server provided in this embodiment includes at least one processor 401 and a memory 402. Optionally, the device 40 also includes a communication component 403. The processor 401, memory 402, and communication component 403 are connected via a bus 404.
[0125] In a specific implementation, at least one processor 401 executes computer execution instructions stored in memory 402, causing at least one processor 401 to perform the above-described method.
[0126] The specific implementation process of processor 401 can be found in the above method embodiments, and its implementation principle and technical effect are similar. It will not be repeated here.
[0127] In the above embodiments, it should be understood that the processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), etc. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in this invention can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules within the processor.
[0128] The memory may include random access memory (RAM) and may also include non-volatile memory (NVM), such as at least one disk storage device.
[0129] The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, the buses shown in the accompanying drawings are not limited to a single bus or a single type of bus.
[0130] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the above-described method.
[0131] This application also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the above-described method.
[0132] The aforementioned readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk, or optical disk. The readable storage medium can be any available medium accessible to a general-purpose or special-purpose computer.
[0133] An exemplary readable storage medium is coupled to a processor, enabling the processor to read information from and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can reside in an Application Specific Integrated Circuit (ASIC). Alternatively, the processor and the readable storage medium can exist as discrete components in the device.
[0134] The division of units is merely a logical functional division; in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, devices, or units, and may be electrical, mechanical, or other forms.
[0135] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0136] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.
[0137] If a function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0138] Those skilled in the art will understand that all or part of the steps of the above-described method embodiments can be implemented by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When executed, the program performs the steps of the above-described method embodiments; and the aforementioned storage medium includes various media capable of storing program code, such as ROM, RAM, magnetic disks, or optical disks.
[0139] Finally, it should be noted that other embodiments of the invention will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein, and is not limited to the precise structures described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of the invention is limited only by the appended claims.
Claims
1. An address matching method, characterized by, The application is applied to a server, comprising: receiving an original address sent by a user end; wherein the original address comprises a cell name; judging whether a social address identical to the cell name exists in a geographic information library; wherein a plurality of social addresses exist in the geographic information library; if it is judged that a social address identical to the cell name exists in the geographic information library, and the distance between the social address identical to the cell name and the original address is within a preset distance threshold, then the social address identical to the cell name is determined as a social address matched with the original address; if it is judged that a social address identical to the cell name does not exist in the geographic information library, then a social address with the highest similarity value to the original address is obtained according to the original address and the geographic information library; judging whether the distance between the social address with the highest similarity value and the original address is within the preset distance threshold; if the distance is not within the preset distance threshold, then a screening range is determined with the original address as a center point and the preset distance threshold as a radius; all social addresses within the screening range are obtained from the geographic information library, and a comprehensive similarity value of each social address to the original address is determined; a social address matched with the original address is determined from all the social addresses according to the comprehensive similarity value.
2. The method of claim 1, wherein, The obtaining of the social address with the highest similarity value to the original address according to the original address and the geographic information library comprises: performing word segmentation on the original address to obtain a plurality of groups of address words; matching each group of address words with a plurality of social addresses in the geographic information library to obtain at least one social address; determining a similarity value of the at least one social address according to a proportion of a preset keyword; obtaining the social address with the highest similarity value to the original address according to the similarity value of the at least one social address.
3. The method of claim 1, wherein, The determination of the comprehensive similarity value of each social address to the original address comprises: obtaining a quantity similarity value of each social address to the original address; obtaining a weight similarity value of each social address to the original address; determining a comprehensive similarity value of each social address to the original address according to the quantity similarity value and the weight similarity value.
4. The method of claim 3, wherein, The obtaining of the quantity similarity value of each social address to the original address comprises: determining a quantity similarity value of each social address according to the number of characters of each social address and the number of identical characters of each social address to the original address; determining a quantity similarity value of the original address according to the number of characters of the original address and the number of identical characters of the original address to each social address; obtaining the quantity similarity value of each social address to the original address according to the quantity similarity value of each social address and the quantity similarity value of the original address.
5. The method of claim 3, wherein, The obtaining of the weight similarity value of each social address to the original address comprises: determining a weight similarity value of each social address according to the character weight of identical characters of each social address to the original address; determine a weight similarity value of the original address according to a character weight of a same character of the original address and each social address; obtain a weight similarity value of each social address and the original address according to the weight similarity value of each social address and the weight similarity value of the original address.
6. The method according to any one of claims 1 to 5, characterized in that, The method further comprises: if the distance is within the preset distance threshold, determining the social address with the highest similarity value as the social address matched with the original address.
7. An address matching apparatus, characterized by comprising: The application is applied to a server, and comprises: a receiving module configured to receive an original address sent by a user end, wherein the original address comprises a cell name; a first determining module configured to determine whether a social address identical to the cell name exists in a geographic information library, wherein the geographic information library comprises a plurality of social addresses; a first determining module configured to determine, if it is determined that the social address identical to the cell name exists in the geographic information library and a distance between the social address with the identical cell name and the original address is within a preset distance threshold, the social address with the identical cell name as the social address matched with the original address; a determining module configured to determine, if it is determined that the social address identical to the cell name does not exist in the geographic information library, a social address with a highest similarity value to the original address according to the original address and the geographic information library; a second determining module configured to determine whether a distance between the social address with the highest similarity value and the original address is within the preset distance threshold; a second determining module configured to determine, if the distance is not within the preset distance threshold, a screening range with the original address as a center point and the preset distance threshold as a radius; a third determining module configured to obtain all social addresses within the screening range from the geographic information library and determine a comprehensive similarity value of each social address to the original address; a fourth determining module configured to determine, according to the comprehensive similarity value, a social address matched with the original address from the all social addresses.
8. A server, characterized by The application comprises: a memory and a processor; the memory stores computer execution instructions; the processor executes the computer execution instructions stored in the memory, so that the processor executes the method according to any one of claims 1-6.
9. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer execution instructions, and the computer execution instructions are executed by the processor to implement the method according to any one of claims 1-6.
10. A computer program product, characterised in that, The computer program is executed by the processor to implement the method according to any one of claims 1-6.