CN115495537A - Address description information processing method and equipment - Google Patents
Address description information processing method and equipment Download PDFInfo
- Publication number
- CN115495537A CN115495537A CN202211086272.9A CN202211086272A CN115495537A CN 115495537 A CN115495537 A CN 115495537A CN 202211086272 A CN202211086272 A CN 202211086272A CN 115495537 A CN115495537 A CN 115495537A
- Authority
- CN
- China
- Prior art keywords
- address
- description information
- location
- address description
- same
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
- G06F16/215—Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2462—Approximate or statistical queries
Abstract
Embodiments disclosed herein provide an address description information processing method and apparatus. Determining at least one location area in a target geographic space, taking the location area in which the location coordinate falls as a location area associated with the address description information according to the address location coordinate in the address description information, then performing similarity judgment on address name texts in the address description information in the same location area, and determining that the address description information containing similar address name texts is matched with the same address according to a similarity judgment result.
Description
Technical Field
Embodiments of the present disclosure relate to the field of information technologies, and in particular, to an address description information processing method and device.
Background
Currently, there is a need for using address libraries for services such as logistics, map navigation, etc. For example, the logistics business needs to provide a retrieval service of a shipping address or a receiving address for a user using an address library.
In practice, it is usually necessary to perform address collection on addresses in a target geographic space associated with an address base, and collect address description information (including address name text and address location coordinates) of the addresses, so as to construct the address base according to the address description information of the addresses.
However, it may happen that a plurality of different address description information is collected for the same address, resulting in redundancy of information of the address pool.
Disclosure of Invention
Embodiments of the present specification provide an address description information processing method and apparatus to identify address description information matching with the same address.
According to a first aspect of various embodiments of the present specification, there is provided an address description information processing method, including:
acquiring a plurality of address description information corresponding to a target geographic space, wherein each address description information comprises an address name text and an address position coordinate;
acquiring at least one location area included in the target geographic space;
for each address description information, if the address position coordinate contained in the address description information falls into any position area, determining that the address description information is associated with the position area;
and performing similarity judgment between address name texts contained in the address description information associated with the same position area, and determining the address description information containing the similar address name texts as the address description information matched with the same address.
According to a second aspect of the embodiments of the present specification, there is provided an address description information processing apparatus including:
the first acquisition module is used for acquiring a plurality of address description information corresponding to a target geographic space, wherein each address description information comprises an address name text and an address position coordinate;
the second acquisition module is used for acquiring at least one position area included by the target geographic space;
the determining module is used for determining that the address description information is associated with any position area if the address position coordinate contained in the address description information falls into the position area;
and the judging module is used for judging the similarity between the address name texts contained in the address description information associated with the same position area and determining the address description information containing the similar address name texts as the address description information matched with the same address.
According to a third aspect of the various embodiments of the present description, a computer-readable storage medium is proposed, on which a computer program is stored which, when being executed by a processor, carries out the method of the first aspect.
According to a fourth aspect of various embodiments herein, there is provided a computing device comprising a memory, a processor; the memory is for storing computer instructions executable on the processor for implementing the method of the first aspect when the computer instructions are executed.
In the above technical solution, considering that in a target geographic space, the probability that address description information containing similar address name texts is matched with the same address is not high, and in a location area smaller than the target geographic space, the probability that address description information containing similar address name texts is matched with the same address may be relatively higher, therefore, at least one location area smaller than the target geographic space is determined in the target geographic space, first, according to address location coordinates in the address description information, the location area in which the location coordinates fall is taken as a location area associated with the address description information, then, similarity judgment is performed between the address name texts in the address description information in the same location area, and according to a result of the similarity judgment, it is determined that the address description information containing similar address name texts is matched with the same address.
By the technical scheme, which address description information belongs to the same address in the multiple address description information collected aiming at the target geographic space can be more accurately identified, so that the multiple address description information belonging to the same address can be conveniently subjected to de-duplication and aggregation, and the information redundancy of the constructed address library is reduced.
Drawings
Fig. 1 exemplarily provides a flow of an address description information processing method.
Fig. 2 exemplarily provides a schematic view of certain address description information while being associated with different location areas.
FIG. 3 illustratively provides a schematic diagram of a Plus Code-based algorithm for partitioning a target address space into a 10-bit encoded multiple location grid.
FIG. 4 illustrates a schematic diagram of the internal multiple subgrids of the location grid providing 8PFRXFVF + FC.
Fig. 5 exemplarily provides a schematic diagram that a single location area includes 9 location grids arranged in a squared grid.
Fig. 6 is a schematic structural diagram of a computing device provided by the present disclosure.
In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts. Any number of elements in the drawings are by way of example and not by way of limitation, and any nomenclature is used for distinction only and not by way of limitation.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all of the embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments in the present specification without any inventive step should fall within the scope of protection of the present specification.
It should be noted that: in other embodiments, the steps of the corresponding methods are not necessarily performed in the order shown and described herein. In some other embodiments, the method may include more or fewer steps than those described herein. Moreover, a single step described in this specification may be broken down into multiple steps in other embodiments; multiple steps described in this specification may be combined into a single step in other embodiments.
An address in this disclosure, represents a place in a geographic space. An address, i.e., address name text and address location coordinates, is generally described based on two pieces of information, which constitute address description information. And the address base can be regarded as a database formed by address description information of a large number of addresses.
The address location coordinates described above are typically latitude and longitude coordinates. The address name text described above generally follows the address level division standard. The address name text in the address description information of the national standard is typically the text of a level 4 address name, such as the street of province a-city B-district C-district D. In actual business, an address library supporting addresses higher than 4 levels, such as addresses of 5-7 levels, needs to be constructed sometimes. The text for a level 5 address name may be, for example, city a, B-C-D street-E cell, the text for a level 6 address name may be, for example, city a, B-C-D street-E cell-F building, and the text for a level 7 address name may be, for example, city a, B-C-D street-E cell-F building-G room.
In order to construct an address library, address acquisition is often required for a geographic space, and the acquisition may be performed by, for example, arranging a worker or an address acquisition vehicle to perform on-site acquisition, or may also be performed by acquiring address description information submitted by a user, or may be performed by acquiring some address description information in an existing address library.
The target geographic space in the present disclosure may refer to a geographic range covered by the address library to be constructed, such as a country or a city.
Generally, the address levels corresponding to the address description information in the same address library are consistent, for example, the address description information in the address library that needs to be constructed in the present disclosure may all correspond to 7-level addresses, and when address acquisition is performed, the purpose of acquiring the address description information corresponding to the 7-level addresses is also taken.
Under the condition of address acquisition aiming at a geographic space, a plurality of different address description information can be acquired aiming at the same address due to acquisition errors (such as errors in manually inputting an address name text, such as errors in identifying an address name of an address acquisition vehicle, and deviation of address position coordinates caused by low positioning accuracy), so that information redundancy of an address base is caused, storage resources are wasted, and troubles are brought when address retrieval is carried out based on the address base.
Therefore, a scheme capable of identifying address description information matched with the same address is required, so that deduplication and aggregation of the address description information matched with the same address can be realized, information redundancy of an address library is avoided, and each address has standardized address description information.
In the technical scheme provided by the disclosure, considering that in a target geographic space, the probability that address description information containing similar address name texts is matched with the same address is not high, and in a position area smaller than the target geographic space, the probability that the address description information containing the similar address name texts is matched with the same address can be relatively higher, therefore, at least one position area smaller than the target geographic space is determined in the target geographic space, firstly, according to address position coordinates in the address description information, the position area in which the position coordinates fall is taken as a position area associated with the address description information, then, similarity judgment is carried out between the address name texts in the address description information in the same position area, and according to a similarity judgment result, the address description information containing the similar address name texts is determined to be matched with the same address.
By the technical scheme, which address description information belongs to the same address in the multiple address description information collected for the target geographic space can be more accurately identified, so that the multiple address description information belonging to the same address can be conveniently subjected to de-duplication and aggregation, and the information redundancy of the constructed address library is reduced.
The technical solutions provided by the present disclosure are explained in detail below.
Fig. 1 exemplarily provides a flow of an address description information processing method, including the following steps:
s100: and acquiring a plurality of address description information corresponding to the target geographic space.
S102: at least one location area included in the target geographic space is obtained.
S104: for each address description information, if the address position coordinate included in the address description information falls into any position area, determining that the address description information is associated with the position area.
S106: and carrying out similarity judgment on address name texts contained in the address description information related to the same position area, and determining the address description information containing the similar address name texts as the address description information matched with the same address.
The target geographic space may be the geographic range covered by the address base that needs to be built. For example, a nationwide address base may be constructed to include address description information of 7-level addresses nationwide, with the target geographic space being nationwide. Such an address library can be provided for logistics services and map navigation services, users served by these services do not need to input address names themselves when searching for a certain address (for example, the user wants to specify a 7-level consignee address), and the services can use the address library to automatically match addresses to users for selection.
The target geospatial space includes at least one location area that is generally an area less than the target geospatial extent.
In one or more embodiments disclosed, a plurality of location areas in a target geographic space that are smaller than the target geographic space may be determined. It is easily understood that the location area is included in the target geographical space, which is a local geographical range in the target geographical space, and the determined collection of the plurality of location areas is the target geographical space.
The size of the delineated location area may be empirically specified. Location areas typically need to meet two requirements: 1. the situation that different addresses have similar address names is unlikely to occur in the location area; 2. even if the position coordinates acquired for a certain address needle in the position area are deviated, the deviated position coordinates are likely to be located in the position area. As an example, the location area may be a rectangular location area of 40m.
In some embodiments, there may be a complete misalignment between any two of the determined plurality of location areas.
In other embodiments, the determined plurality of location areas may include at least two location areas that partially coincide. Further, each of the plurality of determined position areas may have a partial overlapping relationship with other adjacent position areas. It is easy to understand that the larger the number of the defined location areas, the larger the overlapping part between the adjacent location areas, means that the location areas in the target geographic space are more densely distributed, so that the similarity judgment of the address name texts included in the address description information falling into the same location area can be performed, and the address description information matching the same address can be avoided as much as possible.
For two address description information related to the same location area, if the address name texts contained in the two address description information are similar, it is indicated that the two address description information are most likely matched with the same address, and it can be assumed that the two address description information are matched with the same address.
Various known text similarity algorithms may be employed to make the similarity determination between the address name texts. As an example, some address name texts may be obtained in advance, each two of the address name texts form a group, and as a sample, the sample is marked according to whether two address name texts in the same group actually match the same address (the matching to the same address is a positive mark, otherwise, the matching is a negative mark). These samples are used to train an AI model that can be used to make similarity determinations between address name texts.
As another example, some similarity conditions that need to be met for two address name texts to be similar may be set. For example, the similarity condition may be that the proportion of the same character in the address name texts contained in the two address description information reaches a preset proportion; or the address name text contained in one address description information is a subset of the address name text contained in another address description information; or the pinyin expressions of the address name texts contained in the two address description information are the same.
It should be noted that, in the address description information associated with the same location area, the address description information matched with the same address may be determined according to the similarity of the address name texts. The same address description information may be associated with a plurality of location areas at the same time, which means that, for one location area, the address description information may match with some other address description information at the same address, and for another location area, the address description information may match with other address description information at the same address, so that, with the address description information associated with different location areas at the same time as an intermediary, all the address description information matching with the same address across the location areas can be identified.
Fig. 2 exemplarily provides a schematic view of certain address description information while being associated with different location areas. As shown in fig. 2, the address description information 1 is associated with both the location area 1 and the location area 2, the address description information 1 and the address description information 2 are matched to the same address in the location area 1, and the address description information 1 and the address description information 3 are matched to the same address in the location area 2, so that the address description information 1-3 can be determined to be matched to the same address.
In addition, after the address description information matched with the same address is determined, the standardized address description information for constructing the address description information base can be determined according to the address description information matched with the same address. As an example of one implementation, the longest address name text (which often means that the address name contains the most comprehensive information) may be selected from the address name texts of the address description information matching the same address, and the standardized address name text may be determined based on the longest address name text. And meanwhile, according to the address position coordinates in the address description information matched with the same address, determining a coordinate positioned at the center point of the address position coordinates as a standardized address position coordinate. And forming standardized address description information by using the standardized address name text and the standardized address position coordinates.
In addition, in some embodiments, in order to more efficiently define at least one location area in the target geographic space and to more efficiently determine whether the address location coordinates in the certain address description information fall into a certain location area, a location coding algorithm may be used for implementation.
A position-coding algorithm is an algorithm that converts position coordinates (typically latitude and longitude coordinates) into codes, and generally has the property that: the longer the encoded shared prefix of two position coordinates, the closer the two position coordinates are. Alternative position-coding algorithms may be, for example, the Plus Code algorithm, the Geohash algorithm, the what3words algorithm, and so on.
In particular, the target geographic space may be divided into a plurality of location grids such that the location coordinates of different location grids may be converted to different M-bit codes based on a location coding algorithm. A plurality of location areas smaller than the target geospatial space may be determined based on the plurality of location grids, that is, each location area may be comprised of at least one location grid.
This may be understood as dividing the target geographic space into a plurality of location grids according to a certain algorithm accuracy, the higher the algorithm accuracy, the larger M, and the smaller the range covered by a single location grid. A single location area may be composed of one or more location grids. When the position coding algorithm is used for dividing the position area, only one algorithm precision needs to be appointed to obtain a plurality of position grids, and then at least one position area meeting the requirement can be determined efficiently by using the combination of the position grids.
Correspondingly, the address position coordinate in the address description information can be converted into N-bit code based on the position coding algorithm, wherein N is more than or equal to M; if the M-bit prefix of the N-bit code of the address location coordinate in the address description information is an M-bit code of the location coordinate of the location grid in any location area, it is determined that the address location coordinate included in the address description information falls into any location area.
This can be understood as that the address location coordinates in each address description information are converted into N-bit codes according to an algorithm precision not lower than that of dividing the location grid, and by using a prefix matching relationship between the N-bit codes and the M-bit codes, if an M-bit prefix of an N-bit code is an M-bit code of a location grid in a certain location area, it indicates that the location coordinates represented by the N-bit code fall into the location area. Therefore, whether the address position coordinate contained in certain address description information falls into a certain position area or not can be judged efficiently.
As a more specific example. Assuming that the position coding algorithm is Plus Code, experience shows that a single position region can be approximately 40 × 40 rectangles, then according to the algorithm precision setting of Plus Code, M can take 10 (algorithm precision is 13.9M), N can take 11 (algorithm precision is 3.5M), and the single position region comprises 9 position grids (approximately 40 × 40 rectangles) arranged in a nine-grid manner.
FIG. 3 illustratively provides a schematic diagram of a Plus Code-based algorithm for partitioning a target address space into a 10-bit encoded multiple location grid. As shown in FIG. 3, the encoding of 10 may be, for example, 8PFRXFVF + FC.
FIG. 4 illustrates a schematic diagram of the internal multiple subgrids of the location grid providing 8PFRXFVF + FC. As shown in fig. 3, if higher precision (11-bit encoding) is adopted, the inside of 8pfrxfvf + fc may further include a plurality of sub grids, for example, encoding of a certain sub grid is 8pfrxfvf + fcr. If the address location coordinates in the address description information are coded 11 as codes, the range size corresponding to one address location coordinate may correspond to the size of one sub-grid shown in fig. 4.
Fig. 5 illustratively provides a schematic diagram of a single location area including a grid of 9 locations arranged in a grid of nine squares. As shown in fig. 5, for each position grid (algorithm precision of 10-bit coding, side length 13.9 m), the position grid is used as a central region, and neighboring regions are extended to the periphery to form a position region.
The present disclosure also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method of embodiments of the present disclosure.
The present disclosure also provides a computing device comprising a memory, a processor; the memory is used to store computer instructions executable on the processor for implementing the methods of the embodiments of the present disclosure when the computer instructions are executed.
Fig. 6 is a schematic structural diagram of a computing device provided by the present disclosure, where the computing device 15 may include, but is not limited to: a processor 151, a memory 152, and a bus 153 that connects the various system components, including the memory 152 and the processor 151.
Wherein the memory 152 stores computer instructions executable by the processor 151 to enable the processor 151 to perform the methods of any of the embodiments of the present disclosure. The memory 152 may include a random access memory unit RAM1521, a cache memory unit 1522, and/or a read only memory unit ROM1523. The memory 152 may further include: a program tool 1525 having a set of program modules 1524, the program modules 1524 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, one or more combinations of which may comprise an implementation of a network environment.
The bus 153 may include, for example, a data bus, an address bus, a control bus, and the like. The computing device 15 may also communicate with an external device 155 through the I/O interface 154, the external device 155 may be, for example, a keyboard, a bluetooth device, etc. The computing device 150 may also communicate with one or more networks, which may be, for example, local area networks, wide area networks, public networks, etc., through the network adapter 156. The network adapter 156 may also communicate with other modules of the computing device 15 via the bus 153, as shown.
Further, while the operations of the disclosed methods are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
While the spirit and principles of the present disclosure have been described with reference to several particular embodiments, it is to be understood that the present disclosure is not limited to the particular embodiments disclosed, nor is the division of aspects, which is for convenience only as the features in such aspects may not be combined to benefit. The disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
The systems, apparatuses, modules or units described in the above embodiments may be specifically implemented by a computer chip or an entity, or implemented by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units by function, respectively. Of course, the functions of the various elements may be implemented in the same one or more software and/or hardware implementations of the present description.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
This description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. In a typical configuration, a computer includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic disk storage, quantum memory, graphene-based storage media or other magnetic storage devices, or any other non-transmission medium, that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrases "comprising a," "8230," "8230," or "comprising" does not exclude the presence of other like elements in a process, method, article, or apparatus comprising the element.
The foregoing describes several embodiments of the present specification. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The terminology used in the various embodiments of the specification is for the purpose of describing particular embodiments only and is not intended to be limiting of the various embodiments of the specification. As used in this specification and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in various embodiments of the present description to describe various information, the information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of various embodiments herein. The word "if" as used herein may be interpreted as "at" \8230; "or" when 8230; \8230; "or" in response to a determination ", depending on the context.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, the method embodiments are substantially similar to the method embodiments, so that the description is simple, and reference may be made to the partial description of the method embodiments for relevant points. The above-described method embodiments are merely illustrative, wherein the modules described as separate components may or may not be physically separate, and the functions of the modules may be implemented in one or more software and/or hardware when implementing the embodiments of the present specification. And part or all of the modules can be selected according to actual needs to realize the purpose of the scheme of the embodiment. One of ordinary skill in the art can understand and implement without inventive effort.
The above description is only a preferred embodiment of the present disclosure, and should not be taken as limiting the present disclosure, and any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present disclosure should be included in the scope of protection of the present disclosure.
Claims (10)
1. An address description information processing method includes:
acquiring a plurality of address description information corresponding to a target geographic space, wherein each address description information comprises an address name text and an address position coordinate;
acquiring at least one location area included in the target geographic space;
for each address description information, if the address position coordinate contained in the address description information falls into any position area, determining that the address description information is associated with the position area;
and carrying out similarity judgment on address name texts contained in the address description information related to the same position area, and determining the address description information containing the similar address name texts as the address description information matched with the same address.
2. The method of claim 1, wherein obtaining at least one location area included in the target geospatial space comprises:
and acquiring a plurality of location areas included in the target geographic space, wherein the location areas include at least two partially overlapped location areas.
3. The method of claim 1, wherein said obtaining at least one location area included in said target geospatial space comprises:
dividing the target geospatial space into a plurality of location grids, wherein location coordinates of different location grids may be converted to different M-bit codes based on a location coding algorithm; in the position coding algorithm, the longer the shared prefix of the codes of the two position coordinates is, the closer the two position coordinates are;
based on the plurality of location grids, a plurality of location areas smaller than the target geospatial are determined.
4. The method as claimed in claim 3, wherein the step of determining whether the address location coordinate included in the address description information falls into any location area comprises:
based on the position coding algorithm, converting the address position coordinates in the address description information into N-bit codes, wherein N is more than or equal to M;
if the M-bit prefix of the N-bit code of the address location coordinate in the address description information is an M-bit code of the location coordinate of the location grid in any location area, it is determined that the address location coordinate included in the address description information falls into any location area.
5. The method of claim 4, wherein the position encoding algorithm is a Plus Code algorithm.
6. The method of claim 5, wherein N is 11 or 10, M is 10, and each location area comprises 9 location grids in a nine-grid arrangement.
7. The method according to claim 1, wherein the similarity determination between address name texts included in address description information associated with the same location area comprises:
judging whether address name texts contained in every two pieces of address description information related to the same position area meet similarity conditions, and if so, judging the two pieces of address description information as address description information containing similar address name texts;
wherein the similarity condition comprises:
the proportion of the same character in the address name text contained in any two address description information reaches a preset proportion; or
The address name text contained in one address description information is a subset of the address name text contained in the other address description information;
or alternatively
The pinyin expressions of the address name texts contained in any two address description information are the same.
8. The method of claim 1, further comprising:
and determining standardized address description information for constructing an address description information base according to the address description information matched with the same address.
9. A computing device comprising a memory, a processor; the memory is for storing computer instructions executable on a processor for implementing the method of any one of claims 1 to 8 when the computer instructions are executed.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211086272.9A CN115495537A (en) | 2022-09-06 | 2022-09-06 | Address description information processing method and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211086272.9A CN115495537A (en) | 2022-09-06 | 2022-09-06 | Address description information processing method and equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115495537A true CN115495537A (en) | 2022-12-20 |
Family
ID=84468658
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211086272.9A Pending CN115495537A (en) | 2022-09-06 | 2022-09-06 | Address description information processing method and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115495537A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115952779A (en) * | 2023-03-13 | 2023-04-11 | 中规院(北京)规划设计有限公司 | Position name calibration method and device, computer equipment and storage medium |
-
2022
- 2022-09-06 CN CN202211086272.9A patent/CN115495537A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115952779A (en) * | 2023-03-13 | 2023-04-11 | 中规院(北京)规划设计有限公司 | Position name calibration method and device, computer equipment and storage medium |
| CN115952779B (en) * | 2023-03-13 | 2023-09-29 | 中规院(北京)规划设计有限公司 | Position name calibration method and device, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11061984B2 (en) | Grid-based geofence data indexing | |
| CN107092623B (en) | Interest point query method and device | |
| CN109741209B (en) | Multi-source data fusion method, system and storage medium for power distribution network under typhoon disaster | |
| CN103617295A (en) | Method and device for processing geographic information vector data | |
| CN111866727B (en) | Display method and device for driver gathering point, electronic equipment and storage medium | |
| CN111427983B (en) | Service method, system, equipment and storage medium based on geographic information retrieval | |
| CN111221813A (en) | Database index and database query processing method, device and equipment | |
| CN113077181A (en) | Parking station setting method, device, medium and electronic equipment | |
| WO2013182736A1 (en) | Determination of context-aware user preferences | |
| CN115495537A (en) | Address description information processing method and equipment | |
| CN110650531B (en) | Base station coordinate calibration method, system, storage medium and equipment | |
| Karimi et al. | Exploring Real‐Time Geoprocessing in Cloud Computing: Navigation Services Case Study | |
| CN111931077A (en) | Data processing method and device, electronic equipment and storage medium | |
| US20190045324A1 (en) | Application of data structures to geo-fencing applications | |
| CN115481242A (en) | Address text clustering method, device and equipment | |
| CN110222056B (en) | Positioning method, system and equipment | |
| CN116049521A (en) | Space-time data retrieval method based on space grid coding | |
| CN113822098A (en) | Area inspection method and device and electronic equipment | |
| CN114513550B (en) | Geographic position information processing method and device and electronic equipment | |
| CN107657474B (en) | Method for determining business circle boundary and server | |
| US20170147604A1 (en) | Database index for the optimization of distance related queries | |
| CN111460057B (en) | POI (Point of interest) coordinate determining method, device and equipment | |
| CN114676344A (en) | Method and device for determining coordinates of interest points, storage medium and electronic equipment | |
| CN112328725A (en) | Dividing device and method for enterprise geographic position attribution area based on map data | |
| CN114996600B (en) | Multi-temporal image management database data writing and reading method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |