CN116186093B - Address information processing method, address information processing device, electronic equipment and computer readable medium - Google Patents
Address information processing method, address information processing device, electronic equipment and computer readable medium Download PDFInfo
- Publication number
- CN116186093B CN116186093B CN202310437425.8A CN202310437425A CN116186093B CN 116186093 B CN116186093 B CN 116186093B CN 202310437425 A CN202310437425 A CN 202310437425A CN 116186093 B CN116186093 B CN 116186093B
- Authority
- CN
- China
- Prior art keywords
- address
- determining
- address element
- address information
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- 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/25—Integrating or interfacing systems involving database management systems
- G06F16/258—Data format conversion from or to a database
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
- G06F16/316—Indexing structures
- G06F16/322—Trees
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Navigation (AREA)
- Small-Scale Networks (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
The embodiment of the disclosure discloses an address information processing method, an address information processing device, electronic equipment and a computer readable medium. One embodiment of the method comprises the following steps: in response to determining that the at least one address element includes a road number address element, determining whether address data matching the road number address element exists in the matched address data; responsive to determining that there is no address data matching the road number address element, determining whether the at least one address element contains a point of interest address element; responsive to determining that the at least one address element includes a point of interest address element, determining whether address data matching the point of interest address element exists in the respective address data; in response to determining that there is no address data matching the point of interest address element, target address information is constructed from at least one address element. This embodiment ensures the validity of the address entered by the user.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technology, and in particular, to an address information processing method, an address information processing device, an electronic device, and a computer readable medium.
Background
With the rapid development of information retrieval technology, address-based retrieval functions are widely used in network platforms. Currently, for correction processing when a user inputs an address, the following methods are generally adopted: and converting the Chinese character numbers of the addresses input by the user into Arabic numbers, and uniformly converting English of the addresses input by the user into uppercase English.
However, the following technical problems generally exist in the above manner:
first, when the address input by the user lacks an address fragment (e.g., street/administrative area address), the input address is not optimally updated, which easily causes the address input by the user to be referred to as unclear;
secondly, when a certain address is changed, the address input by the user is still the address before the change, so that the input address has lower precision;
thirdly, when the addresses of users are complemented, only building addresses are often added, so that part of users are difficult to clearly complement the addresses.
The above information disclosed in this background section is only for enhancement of understanding of the background of the inventive concept and, therefore, may contain information that does not form the prior art that is already known to those of ordinary skill in the art in this country.
Disclosure of Invention
The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose address information processing methods, apparatuses, electronic devices, and computer readable media to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide an address information processing method, including: splitting the address information to be detected according to a preset address tree to obtain split address information, wherein the split address information comprises: at least one address element; determining whether the at least one address element contains a road address element; determining whether address data matching the split address information and the road address elements exists in a preset address database or not in response to determining that the at least one address element contains the road address elements, wherein the address data in the address database contains an address element sequence; determining whether the at least one address element contains a road number address element in response to determining that address data matching the split address information and the road address element exists in the address database; determining whether address data matching the road number address element exists in each matched address data in response to determining that the road number address element is contained in the at least one address element; determining whether the at least one address element includes a point of interest address element in response to determining that there is no address data matching the road number address element; determining whether address data matching the point of interest address element exists in the respective address data in response to determining that the point of interest address element is included in the at least one address element; and constructing target address information according to the at least one address element in response to determining that there is no address data matching the point of interest address element.
In a second aspect, some embodiments of the present disclosure provide an address information processing apparatus, the apparatus including: the splitting unit is configured to split the address information to be detected according to a preset address tree to obtain split address information, wherein the split address information comprises: at least one address element; a first determining unit configured to determine whether the at least one address element includes a road address element; a second determining unit configured to determine whether address data matching the split address information and the road address element exists in a preset address database in response to determining that the at least one address element includes the road address element, wherein the address data in the address database includes an address element sequence; a third determining unit configured to determine whether the at least one address element includes a road number address element in response to determining that address data matching the split address information and the road address element exists in the address database; a fourth determination unit configured to determine whether address data matching the road number address element exists in each of the matched address data in response to determining that the road number address element is included in the at least one address element; a fifth determining unit configured to determine whether the at least one address element includes a point of interest address element in response to determining that there is no address data matching the road number address element; a sixth determining unit configured to determine whether address data matching the point of interest address element exists in the respective address data in response to determining that the point of interest address element is included in the at least one address element; and a construction unit configured to construct target address information from the at least one address element in response to determining that there is no address data matching the point of interest address element.
In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors causes the one or more processors to implement the method described in any of the implementations of the first aspect above.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect above.
The above embodiments of the present disclosure have the following advantageous effects: by the address information processing method of some embodiments of the present disclosure, validity of the address input by the user is ensured. Specifically, the reason for the easy confusion of the address designation entered by the user is that: when the address entered by the user lacks an address fragment (e.g., a street/administrative area address), no optimization update is made to the entered address. Based on this, the address information processing method of some embodiments of the present disclosure first splits the address information to be detected according to a preset address tree to obtain split address information. Wherein, the split address information includes: at least one address element. Thereby, it is facilitated to determine the address element for which the address information to be detected is missing. Next, it is determined whether the at least one address element includes a road address element. Then, in response to determining that the at least one address element contains a road address element, determining whether address data matching the split address information and the road address element exists in a preset address database. Wherein the address data in the address database comprises a sequence of address elements. Thus, the address information to be detected is supplemented according to the address database. And then, in response to determining that address data matching the split address information and the road address elements exists in the address database, determining whether the at least one address element contains a road number address element. Then, in response to determining that the at least one address element includes a road number address element, it is determined whether address data matching the road number address element exists in the matched respective address data. Then, in response to determining that there is no address data matching the road number address element, determining whether the at least one address element includes a point of interest address element; in response to determining that the at least one address element includes a point of interest address element, determining whether address data matching the point of interest address element exists in the respective address data. Thereby, the missing address element in the address information to be detected is conveniently determined, so that the missing address element is conveniently supplemented. And finally, constructing target address information according to the at least one address element in response to determining that the address data matching the interest point address element does not exist. Therefore, the missing address elements can be complemented and updated, and the validity of the address input by the user is ensured.
Drawings
The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
FIG. 1 is a flow chart of some embodiments of an address information processing method according to the present disclosure;
FIG. 2 is a schematic diagram of the structure of some embodiments of an address information processing apparatus according to the present disclosure;
fig. 3 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.
It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.
The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a flow chart of some embodiments of an address information processing method according to the present disclosure. A flow 100 of some embodiments of an address information processing method according to the present disclosure is shown. The address information processing method comprises the following steps:
And step 101, splitting the address information to be detected according to a preset address tree to obtain split address information.
In some embodiments, an execution body (e.g., a server) of the address information processing method may split the address information to be detected according to a preset address tree, to obtain split address information. Wherein, the split address information includes: at least one address element. The address tree may be made up of an arrangement of individual tree nodes. Each tree node may include: administrative address elements, street address elements, road number address elements, point of interest address elements, building number address elements. Administrative address elements may include province, city, district (county). The street address element may refer to a street name in a certain area. The road address element may represent a certain road name. The road number address element may represent a road number (people road 72) in a certain road. The point of interest address element may represent POI (Point of Interest) points of interest. The building number address element may represent a specific number of a building.
That is, the address information to be detected may be split according to each tree node (administrative address element, street address element, road number address element, interest point address element, building number address element) to obtain split address information.
Optionally, before splitting the address information to be detected according to the preset address tree to obtain the split address information, the method further includes:
the first step, in response to receiving address information sent by a user, converting Chinese numbers included in the address information into Arabic numbers to obtain first converted address information.
And a second step of converting the full-angle symbol in the first converted address information into a half-angle symbol to obtain second converted address information.
Thirdly, english in the second converted address information is converted into a standard format, and third converted address information serving as address information to be detected is obtained. Here, the standard format may refer to a uppercase english format.
In some embodiments, the execution body may determine whether the at least one address element includes a road address element.
In some embodiments, the executing body may determine whether address data matching the split address information and the road address element exists in a preset address database in response to determining that the at least one address element includes the road address element. Wherein the address data in the address database comprises a sequence of address elements. That is, first, address data identical to the administrative area corresponding to the split address information is specified. Then, a similarity of the road address element included in each address data and the above-described road address element is determined (for example, by a euclidean distance formula). And determining the address data with the similarity larger than a preset threshold value as the address data matched with the road address elements. The address element sequence comprises an administrative address element, a street address element, a road number address element, a point of interest address element and a building number address element.
In some embodiments, the executing entity may determine whether the at least one address element includes a road number address element in response to determining that address data matching the split address information and the road address element exists in the address database.
In response to determining that the at least one address element includes a road number address element, it is determined whether address data matching the road number address element exists in the matched address data.
In some embodiments, the executing entity may determine whether address data matching the road number address element exists in the matched address data in response to determining that the road number address element is included in the at least one address element. That is, the similarity of the road number address element included in each address data and the above road number address element may be determined by the euclidean distance formula. Then, address data having a similarity greater than a preset similarity may be determined as address data matching the above-mentioned road number address element.
In some embodiments, the execution body may determine whether the at least one address element includes a point of interest address element in response to determining that there is no address data that matches the road number address element.
In response to determining that the at least one address element includes a point of interest address element, determining whether address data matching the point of interest address element exists in the respective address data, step 107.
In some embodiments, the execution body may determine whether address data matching the point of interest address element exists in the respective address data in response to determining that the point of interest address element is included in the at least one address element. First, the similarity between the point-of-interest address element included in each address data and the point-of-interest address element can be determined by a euclidean distance formula. Finally, address data with similarity greater than the preset similarity can be determined as address data matching the address elements of the interest points.
And step 108, in response to determining that the address data matching the address element of the interest point does not exist, constructing target address information according to the at least one address element.
In some embodiments, the execution body may construct the target address information from the at least one address element in response to determining that there is no address data that matches the point of interest address element. For example, the missing address elements may be supplemented to the at least one address element according to each tree node of the address tree, and then the supplemented address element groups may be sorted according to the order of each tree node to obtain the address element sequence as the target address information.
In practice, the execution subject may construct the target address information by:
and a first step of performing a filling process on the at least one address element according to each tree node included in the address tree to generate a filling address element group. I.e. to supplement the missing address elements.
And secondly, sorting the complementary address element groups to obtain a complementary address element sequence as target address information. That is, the above-described complementary address element groups are sorted in the order of the tree nodes.
Optionally, in response to determining that there is address data matching the road number address element and that there is address data matching the point of interest address element, determining whether the at least one address element includes a building number address element.
In some embodiments, the executing entity may determine whether the at least one address element includes a building number address element in response to determining that there is address data that matches the road number address element and that there is address data that matches the point of interest address element.
Optionally, in response to determining that the at least one address element includes a building number address element, determining whether address data matching the building number address element exists in the respective address data.
In some embodiments, the executing entity may determine whether address data matching the building number address element exists in the respective address data in response to determining that the building number address element is included in the at least one address element. That is, the similarity between the building number address elements included in each address data and the building number address elements described above may be determined by the euclidean distance formula. Then, address data with similarity greater than or equal to a preset threshold value is determined as address data matching the building number address elements.
Optionally, in response to determining that address data matching the building number address element exists in the address data, determining address data matching the building number address element in the address data as alternative address data, and obtaining an alternative address data set.
In some embodiments, the executing entity may determine, as the candidate address data, address data matching the building number address element in the respective address data in response to determining that address data matching the building number address element exists in the respective address data, to obtain the candidate address data set.
Optionally, the target address data is determined according to the application times corresponding to the alternative address data in the alternative address data set.
In some embodiments, the execution body may determine the target address data according to the number of applications corresponding to the candidate address data in the candidate address data set. That is, the number of applications may refer to the number of uses of the address data. The candidate address data with the largest application times in the candidate address data group can be determined as target address data.
Optionally, according to the target address data, the address information to be detected is subjected to filling processing, so that filling address information is obtained as target address information.
In some embodiments, the execution body may perform a patch process on the address information to be detected according to the target address data, to obtain patch address information as target address information. That is, each address element included in the address information to be detected may be compared with each address element included in the target address data, so as to determine an address element in which the address information to be detected is missing. And then, the address elements with the missing address information to be detected can be complemented, and the complemented address information is obtained as target address information.
The above-mentioned related matters serve as an invention point of the present disclosure, thereby solving the second technical problem mentioned in the background art, which results in lower input address accuracy. ". Factors that lead to lower input address accuracy tend to be as follows: when a certain address is changed, the address input by the user is still the address before the change. If the above factors are solved, the effect of improving the accuracy of the input address can be achieved. To achieve this, first, in response to determining that there is address data that matches the road number address element and that matches the point of interest address element, it is determined whether the at least one address element contains a building number address element. And then, in response to determining that the at least one address element contains a building number address element, determining whether address data matched with the building number address element exists in the address data. Then, in response to determining that address data matching the building number address element exists in the address data, address data matching the building number address element in the address data is determined as alternative address data, and an alternative address data group is obtained. Thereby, the input address is convenient to be updated in a filling way. And then, determining target address data according to the application times corresponding to the alternative address data in the alternative address data group. And finally, carrying out filling processing on the address information to be detected according to the target address data to obtain filling address information serving as target address information. Therefore, the input address can be updated in a filling way, and the input address precision is improved.
Optionally, in response to determining that the at least one address element does not include a road address element, determining whether the at least one address element includes a street address element.
In some embodiments, the execution body may determine whether the at least one address element includes a street address element in response to determining that the at least one address element does not include a road address element.
Optionally, in response to determining that the at least one address element includes a street address element, determining whether address data matching the street address element exists in the respective address data.
In some embodiments, the executing entity may determine whether address data matching the street address element exists in the respective address data in response to determining that the street address element is included in the at least one address element. That is, first, the similarity of the street address element included in each address data and the above-described street address element may be determined by the euclidean distance formula. Then, address data having a similarity equal to or greater than a preset similarity may be determined as address data matching the above-mentioned street address elements.
Optionally, in response to determining that there is address data matching the street address element and address data matching the point of interest address element, and that there is no address data matching the building number address element, performing a patch process on the address information to be detected according to the address data matching the street address element and the point of interest address element, to obtain patch address information as target address information.
In some embodiments, the executing entity may perform the patch processing on the address information to be detected according to the address data matching the street address element and the address data matching the address element of the interest point, where the address data matching the address element of the interest point does not exist, and the patch address information is obtained as the target address information. That is, at least one address data that matches the street address element and matches the point of interest address element may be determined. And then, determining the address data with the largest application times in the at least one address data as target address data. And finally, carrying out filling processing on the address information to be detected according to each address element included in the target address data to obtain filling address information serving as target address information.
Optionally, in response to determining that there is no address data matching the street address element, performing a fill-in process on the at least one address element according to each tree node included in the address tree to generate a fill-in address element group.
In some embodiments, the execution body may perform a fill-in process on the at least one address element to generate a fill-in address element group according to each tree node included in the address tree in response to determining that there is no address data matching the street address element.
Optionally, sorting the above-mentioned complement address element groups to obtain a complement address element sequence as target address information.
In some embodiments, the execution body may perform sorting processing on the patch address element group to obtain a patch address element sequence as the target address information.
Optionally, the address database is constructed by the following steps:
the first step, at least one using address information of each user in the user group is obtained, and a using address information set is obtained. The used address information may be address information used by the user. For example, the usage address information may be [ dream district De cloud street large male tulip house 6 floor 5 ].
And secondly, splitting each of the use address information sets according to the address tree to generate a use address element sequence, thereby obtaining a use address element sequence set. Here, the splitting process may be performed on each of the above-described use address information sets by each tree node included in the address tree to generate a use address element sequence, resulting in a use address element sequence set.
And thirdly, clustering the use address information in the use address information set to generate a use address information group set. Here, the above-described individual pieces of usage address information that characterize the same place in the usage address information set may be grouped into one type to generate the usage address information group set.
Fourth, for each of the above-described used address information groups, the following processing steps are performed:
a first sub-step of determining the number of the use address information included in the use address information group as the number of applications.
And a second sub-step of determining each of the used address element sequences corresponding to the used address information group as a used address element sequence group.
And a third sub-step of determining, as the target used address element sequence, the used address element sequence having the largest number of used address elements included in the used address element sequence group.
And a fourth sub-step of performing a filling process on the target address element sequence according to each tree node included in the address tree to generate a filling target address element sequence. That is, first, each tree node is compared with the target-use address element sequence to determine a missing address element. Then, the target uses the missing address element in the address element sequence to make up.
And fifth substep, combining the sequence of the address elements used by the filling target and the application times into address data. Combining may be referred to as merging.
And fifthly, storing the combined address data into a preset database to obtain an address database.
The related matters in the first step to the fifth step are taken as an invention point of the present disclosure, so that the third technical problem mentioned in the background art is solved, and it is difficult for some users to clearly repair the address. ". Factors that make it difficult for some users to clearly complement the address are often as follows: when the addresses of users are complemented, only building addresses are often added. If the above factors are solved, the effect of clearly supplementing the address can be achieved. To achieve this, first, at least one usage address information of each user in the user group is acquired, resulting in a usage address information set. Thus, a comprehensive address database is facilitated to be built. And secondly, splitting each of the use address information sets according to the address tree to generate a use address element sequence, thereby obtaining the use address element sequence set. Thus, it is convenient to complement the address information and determine the number of uses. Then, clustering processing is performed on each of the above-described usage address information sets to generate a usage address information group set. Thereby, it is convenient to determine the number of times of use of the address information. Then, for each of the above-described used address information groups, the following processing steps are performed: determining the number of the use address information included in the use address information group as the application times; determining each used address element sequence corresponding to the used address information group as a used address element sequence group; determining a sequence of use address elements having the largest number of use address elements included in the sequence of use address elements as a target sequence of use address elements; performing complement processing on the target use address element sequence according to each tree node included in the address tree so as to generate a complement target use address element sequence; and combining the sequence of the complement target using address elements and the application times into address data. Therefore, the address elements can be supplemented, so that the address data is more comprehensive. And finally, storing each combined address data into a preset database to obtain an address database. Thus, the completed address can be clearly complemented.
With further reference to fig. 2, as an implementation of the method shown in the above figures, the present disclosure provides some embodiments of an address information processing apparatus, which correspond to those method embodiments shown in fig. 2, and which are particularly applicable to various electronic devices.
As shown in fig. 2, the address information processing apparatus 200 of some embodiments includes: a splitting unit 201, a first determining unit 202, a second determining unit 203, a third determining unit 204, a fourth determining unit 205, a fifth determining unit 206, a sixth determining unit 207, and a constructing unit 208. The splitting unit 201 is configured to split the address information to be detected according to a preset address tree to obtain split address information, where the split address information includes: at least one address element; a first determining unit 202 configured to determine whether the at least one address element includes a road address element; a second determining unit 203 configured to determine whether address data matching the split address information and the road address element exists in a preset address database in response to determining that the at least one address element includes a road address element, wherein the address data in the address database includes an address element sequence; a third determining unit 204 configured to determine whether the at least one address element includes a road number address element in response to determining that address data matching the split address information and the road address element exists in the address database; a fourth determining unit 205 configured to determine whether address data matching the road number address element exists in each of the matched address data in response to determining that the road number address element is included in the at least one address element; a fifth determining unit 206 configured to determine whether the at least one address element contains a point of interest address element in response to determining that there is no address data matching the road number address element; a sixth determining unit 207 configured to determine whether address data matching the point of interest address element exists in the respective address data in response to determining that the point of interest address element is included in the at least one address element; a construction unit 208 is configured to construct the target address information from the at least one address element in response to determining that there is no address data matching the point of interest address element.
It will be appreciated that the elements described in the address information processing apparatus 200 correspond to the respective steps in the method described with reference to fig. 1. Thus, the operations, features and advantages described above for the method are equally applicable to the address information processing apparatus 200 and the units contained therein, and are not described herein.
Referring now to fig. 3, a schematic diagram of an electronic device (e.g., server) 300 suitable for use in implementing some embodiments of the present disclosure is shown. The electronic devices in some embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), car terminals (e.g., car navigation terminals), and the like, as well as stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 3 is merely an example and should not impose any limitations on the functionality and scope of use of embodiments of the present disclosure.
As shown in fig. 3, the electronic device 300 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 301 that may perform various suitable actions and processes in accordance with a program stored in a Read Only Memory (ROM) 302 or a program loaded from a storage means 308 into a Random Access Memory (RAM) 303. In the RAM303, various programs and data required for the operation of the electronic apparatus 300 are also stored. The processing device 301, the ROM302, and the RAM303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
In general, the following devices may be connected to the I/O interface 305: input devices 306 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 307 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 308 including, for example, magnetic tape, hard disk, etc.; and communication means 309. The communication means 309 may allow the electronic device 300 to communicate with other devices wirelessly or by wire to exchange data. While fig. 3 shows an electronic device 300 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 3 may represent one device or a plurality of devices as needed.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via communications device 309, or from storage device 308, or from ROM 302. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing means 301.
It should be noted that, the computer readable medium described in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: splitting the address information to be detected according to a preset address tree to obtain split address information, wherein the split address information comprises: at least one address element; determining whether the at least one address element contains a road address element; determining whether address data matching the split address information and the road address elements exists in a preset address database or not in response to determining that the at least one address element contains the road address elements, wherein the address data in the address database contains an address element sequence; determining whether the at least one address element contains a road number address element in response to determining that address data matching the split address information and the road address element exists in the address database; determining whether address data matching the road number address element exists in each matched address data in response to determining that the road number address element is contained in the at least one address element; determining whether the at least one address element includes a point of interest address element in response to determining that there is no address data matching the road number address element; determining whether address data matching the point of interest address element exists in the respective address data in response to determining that the point of interest address element is included in the at least one address element; and constructing target address information according to the at least one address element in response to determining that there is no address data matching the point of interest address element.
Computer program code for carrying out operations for some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The described units may also be provided in a processor, for example, described as: a processor comprising: the device comprises a splitting unit, a first determining unit, a second determining unit, a third determining unit, a fourth determining unit, a fifth determining unit, a sixth determining unit and a constructing unit. Wherein the names of the units do not constitute a limitation of the unit itself in some cases, for example, the construction unit may also be described as "a unit for constructing the target address information from the at least one address element in response to determining that there is no address data matching the above-mentioned point-of-interest address element".
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.
Claims (7)
1. An address information processing method, comprising:
splitting the address information to be detected according to a preset address tree to obtain split address information, wherein the split address information comprises: at least one address element;
determining whether a road address element is included in the at least one address element;
determining whether address data matching the split address information and the road address elements exists in a preset address database or not according to the fact that the at least one address element contains the road address elements, wherein the address data in the address database contains an address element sequence;
Determining whether a road number address element is included in the at least one address element in response to determining that address data matching the split address information and the road address element exists in the address database;
in response to determining that the at least one address element contains a road number address element, determining whether address data matching the road number address element exists in each of the matched address data;
responsive to determining that there is no address data matching the road number address element, determining whether a point of interest address element is contained in the at least one address element;
responsive to determining that the at least one address element includes a point of interest address element, determining whether address data matching the point of interest address element exists in the respective address data;
and in response to determining that there is no address data matching the point of interest address element, constructing target address information from the at least one address element.
2. The method of claim 1, wherein said constructing target address information from said at least one address element comprises:
performing a filling process on the at least one address element according to each tree node included in the address tree to generate a filling address element group;
And sequencing the complement address element groups to obtain a complement address element sequence as target address information.
3. The method of claim 1, wherein the method further comprises:
determining whether the at least one address element contains a building number address element in response to determining that there is address data matching the road number address element and that there is address data matching the point of interest address element;
responsive to determining that the at least one address element contains a building number address element, determining whether address data matching the building number address element exists in the respective address data;
in response to determining that address data matched with the building number address element exists in the address data, determining the address data matched with the building number address element in the address data as alternative address data, and obtaining an alternative address data set;
determining target address data according to the application times corresponding to the alternative address data in the alternative address data group;
and carrying out filling processing on the address information to be detected according to the target address data to obtain filling address information serving as target address information.
4. The method of claim 1, wherein before splitting the address information to be detected according to the preset address tree to obtain split address information, the method further comprises:
responding to the received address information sent by a user, converting Chinese numbers included in the address information into Arabic numbers, and obtaining first converted address information;
converting the full-angle symbol in the first converted address information into a half-angle symbol to obtain second converted address information;
and converting English in the second converted address information into a standard format to obtain third converted address information serving as address information to be detected.
5. An address information processing apparatus comprising:
the splitting unit is configured to split the address information to be detected according to a preset address tree to obtain split address information, wherein the split address information comprises: at least one address element;
a first determination unit configured to determine whether a road address element is included in the at least one address element;
a second determining unit configured to determine whether address data matching the split address information and the road address element exists in a preset address database in response to determining that the at least one address element contains the road address element, wherein the address data in the address database contains an address element sequence;
A third determining unit configured to determine whether a road number address element is included in the at least one address element in response to determining that address data matching the split address information and the road address element exists in the address database;
a fourth determination unit configured to determine whether address data matching the road number address element exists in each of the matched address data in response to determining that the road number address element is included in the at least one address element;
a fifth determining unit configured to determine whether a point of interest address element is included in the at least one address element in response to determining that there is no address data matching the road number address element;
a sixth determination unit configured to determine whether address data matching the point of interest address element exists in the respective address data in response to determining that the point of interest address element is included in the at least one address element;
a construction unit configured to construct target address information from the at least one address element in response to determining that there is no address data matching the point of interest address element.
6. An electronic device, comprising:
One or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-4.
7. A computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method of any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310437425.8A CN116186093B (en) | 2023-04-23 | 2023-04-23 | Address information processing method, address information processing device, electronic equipment and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310437425.8A CN116186093B (en) | 2023-04-23 | 2023-04-23 | Address information processing method, address information processing device, electronic equipment and computer readable medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116186093A CN116186093A (en) | 2023-05-30 |
| CN116186093B true CN116186093B (en) | 2023-07-14 |
Family
ID=86452377
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310437425.8A Active CN116186093B (en) | 2023-04-23 | 2023-04-23 | Address information processing method, address information processing device, electronic equipment and computer readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116186093B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127768A (en) * | 2007-08-24 | 2008-02-20 | 张建中 | Method, device and system for creating multi-dimension inter-network protocol |
| CN102314645A (en) * | 2011-09-26 | 2012-01-11 | 深圳市络道科技有限公司 | Address matching method and system |
| CN102393937A (en) * | 2011-10-12 | 2012-03-28 | 深圳市络道科技有限公司 | Address matching method and system of address tree based on backward production |
| CN107016084A (en) * | 2017-03-31 | 2017-08-04 | 江苏速度信息科技股份有限公司 | A kind of place name address quickly positions the method with inquiry |
| CN108733810A (en) * | 2018-05-21 | 2018-11-02 | 北京神州泰岳软件股份有限公司 | A kind of address date matching process and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5849146B1 (en) * | 2014-11-05 | 2016-01-27 | ウイングアーク１ｓｔ株式会社 | Address / latitude / longitude conversion device and geographic information system using the same |
-
2023
- 2023-04-23 CN CN202310437425.8A patent/CN116186093B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127768A (en) * | 2007-08-24 | 2008-02-20 | 张建中 | Method, device and system for creating multi-dimension inter-network protocol |
| CN102314645A (en) * | 2011-09-26 | 2012-01-11 | 深圳市络道科技有限公司 | Address matching method and system |
| CN102393937A (en) * | 2011-10-12 | 2012-03-28 | 深圳市络道科技有限公司 | Address matching method and system of address tree based on backward production |
| CN107016084A (en) * | 2017-03-31 | 2017-08-04 | 江苏速度信息科技股份有限公司 | A kind of place name address quickly positions the method with inquiry |
| CN108733810A (en) * | 2018-05-21 | 2018-11-02 | 北京神州泰岳软件股份有限公司 | A kind of address date matching process and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116186093A (en) | 2023-05-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112328927B (en) | Document processing method and device, readable medium and electronic equipment | |
| CN111857720B (en) | User interface state information generation method and device, electronic equipment and medium | |
| CN113407767A (en) | Method and device for determining text relevance, readable medium and electronic equipment | |
| CN111597107B (en) | Information output method and device and electronic equipment | |
| CN113807056B (en) | Document name sequence error correction method, device and equipment | |
| CN116186093B (en) | Address information processing method, address information processing device, electronic equipment and computer readable medium | |
| CN113157695B (en) | Data processing method and device, readable medium and electronic equipment | |
| CN114625876B (en) | Method for generating author characteristic model, method and device for processing author information | |
| CN111626044B (en) | Text generation method, text generation device, electronic equipment and computer readable storage medium | |
| CN111737572B (en) | Search statement generation method and device and electronic equipment | |
| CN111143355B (en) | Data processing method and device | |
| CN111737571A (en) | Searching method and device and electronic equipment | |
| CN111797263A (en) | Image label generation method, device, equipment and computer readable medium | |
| CN111782895A (en) | Retrieval processing method and device, readable medium and electronic equipment | |
| CN111753238A (en) | Data mapping method and device and electronic equipment | |
| CN116503849B (en) | Abnormal address identification method, device, electronic equipment and computer readable medium | |
| CN116483808B (en) | Data migration method, device, electronic equipment and computer readable medium | |
| CN116541421B (en) | Address query information generation method and device, electronic equipment and computer medium | |
| CN111797932B (en) | Image classification method, apparatus, device and computer readable medium | |
| CN115374320B (en) | Text matching method and device, electronic equipment and computer medium | |
| CN117743555B (en) | Reply decision information transmission method, device, equipment and computer readable medium | |
| CN115994120B (en) | Data file merging method, device, electronic equipment and computer readable medium | |
| CN116880909A (en) | Offline device identification method, device, electronic device and computer readable medium | |
| CN116933758A (en) | Text sequence alignment method, apparatus, electronic device and computer readable medium | |
| CN116415092A (en) | Information processing method and device and electronic equipment |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |