CN116933775A - Site determining method and related equipment - Google Patents

Site determining method and related equipment Download PDF

Info

Publication number
CN116933775A
CN116933775A CN202210370083.8A CN202210370083A CN116933775A CN 116933775 A CN116933775 A CN 116933775A CN 202210370083 A CN202210370083 A CN 202210370083A CN 116933775 A CN116933775 A CN 116933775A
Authority
CN
China
Prior art keywords
address
keyword
keywords
query result
preset
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
Application number
CN202210370083.8A
Other languages
Chinese (zh)
Inventor
李志朋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN202210370083.8A priority Critical patent/CN116933775A/en
Publication of CN116933775A publication Critical patent/CN116933775A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/279—Recognition of textual entities
    • G06F40/284—Lexical analysis, e.g. tokenisation or collocates
    • 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/33—Querying
    • G06F16/3331—Query processing
    • G06F16/3332—Query translation
    • G06F16/3334—Selection or weighting of terms from queries, including natural language queries
    • 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/33—Querying
    • G06F16/3331—Query processing
    • G06F16/334—Query execution
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computational Linguistics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Artificial Intelligence (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The disclosure provides a site determining method, a site determining device, electronic equipment and a storage medium. The method comprises the following steps: acquiring a receipt address, wherein the receipt address comprises English characters; splitting the receipt address to obtain an address keyword set, wherein the address keyword set comprises one or more address keywords; inquiring a key value table according to the address keywords to obtain an inquiring result, wherein one preset keyword or a plurality of preset keyword combinations are used as keys in the key value table, and one or a plurality of preset keywords or site identifiers are used as values; if the query result contains the preset keyword, updating the address keyword according to the address keyword and the query result; and inquiring the key value table according to the updated address keywords to determine the target site corresponding to the destination address. The method can automatically, quickly and accurately determine the target site corresponding to the receiving address.

Description

Site determining method and related equipment
Technical Field
The disclosure relates to the technical field of logistics, and in particular relates to a station determining method, a station determining device, electronic equipment and a storage medium.
Background
In the related technology, positioning to the affiliated fence according to the full address resolution longitude and latitude through a GIS (Geographic Information System ), and then identifying a pre-sorting site bound by the fence; or, according to the three-level address matching binding pre-sorting site, the method excessively depends on a charging API (Application Programming Interface, application program interface) of an external map manufacturer, and when the three-level address is changed, fence binding information needs to be modified to be effective and is not suitable for a scene of English characters.
It should be noted that the information disclosed in the above background section is only for enhancing understanding of the background of the present disclosure and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The invention aims to provide a site determining method, a device, electronic equipment and a storage medium, wherein the method can automatically, quickly and accurately determine a target site corresponding to a destination address.
Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.
The embodiment of the disclosure provides a station determining method, which comprises the following steps: acquiring a receipt address, wherein the receipt address comprises English characters; splitting the receipt address to obtain an address keyword set, wherein the address keyword set comprises one or more address keywords; inquiring a key value table according to the address keywords to obtain an inquiring result, wherein one preset keyword or a plurality of preset keyword combinations are used as keys in the key value table, and one or a plurality of preset keywords or site identifiers are used as values; if the query result contains the preset keyword, updating the address keyword according to the address keyword and the query result; and inquiring the key value table according to the updated address keywords to determine the target site corresponding to the destination address.
In some exemplary embodiments of the present disclosure, if the query result includes the preset keyword, updating the address keyword according to the address keyword and the query result includes: and if the query result is a keyword, connecting the address keyword with the query result through a preset character and then using the connected address keyword as an updated address keyword.
In some exemplary embodiments of the present disclosure, if the query result includes the preset keyword, updating the address keyword according to the address keyword and the query result includes: if the query result is a plurality of keywords separated by a first character and at least one of the plurality of keywords exists in the address keyword set, connecting the address keyword with any keyword in the query result through a preset character to serve as an updated address keyword.
In some exemplary embodiments of the present disclosure, if the query result includes the preset keyword, updating the address keyword according to the address keyword and the query result includes: if the query result is a plurality of keywords separated by the second character and the plurality of keywords exist in the address keyword set, the address keywords are connected with the plurality of keywords in the query result through preset characters and then used as updated address keywords.
In some exemplary embodiments of the present disclosure, the above method further comprises: and if the query result is the site identification, determining the site corresponding to the query result as a target site.
In some exemplary embodiments of the present disclosure, splitting the recipient address to obtain an address keyword set includes: splitting the receiving address according to hump rules to obtain an address keyword set; and/or performing cyclic matching on the destination address to obtain an address keyword set.
In some exemplary embodiments of the present disclosure, performing loop matching on the destination address to obtain an address keyword set, including: sequentially determining each character of the receiver address as a matching character; sequentially and incrementally intercepting the receipt address from the matched character to obtain a target character string; and matching the target character string with the key value table to obtain the address keyword set.
The embodiment of the disclosure provides a station determining device, which comprises: the receiving address acquisition module is used for acquiring a receiving address, and the receiving address comprises English characters; the receiving address splitting module is used for splitting the receiving address to obtain an address keyword set, wherein the address keyword set comprises one or more address keywords; the query result obtaining module is used for obtaining a query result according to the address keyword query key value table, wherein one preset keyword or a plurality of preset keyword combinations are used as keys in the key value table, and one or a plurality of preset keywords or site identifiers are used as values; the address keyword updating module is used for updating the address keyword according to the address keyword and the query result if the query result contains the preset keyword; and the site determining module is used for inquiring the key value table according to the updated address keywords so as to determine the target site corresponding to the destination address.
An embodiment of the present disclosure provides an electronic device, including: at least one processor; and a storage means for storing at least one program which, when executed by the at least one processor, causes the at least one processor to implement any of the site determination methods described above.
The disclosed embodiments provide a computer readable storage medium having a computer program stored thereon, characterized in that the computer program, when executed by a processor, implements a site determining method as any one of the above.
According to the site determining method provided by the embodiment of the disclosure, the address keyword set is obtained by splitting the destination address, and the query result is obtained according to the address keyword query key value table in the address keyword set; if the query result contains preset keywords in the key value table, updating the address keywords according to the address keywords and the query result; and continuously inquiring the key value table according to the updated address keywords until the target site corresponding to the receiving address is determined. The site determining method can be applied to a scene that the receiving address contains English characters, and can automatically, quickly and accurately determine the target site corresponding to the receiving address.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure. It will be apparent to those of ordinary skill in the art that the drawings in the following description are merely examples of the disclosure and that other drawings may be derived from them without undue effort.
Fig. 1 shows a schematic diagram of an exemplary system architecture to which the site determination method of the embodiments of the present disclosure may be applied.
Fig. 2 is a flow chart illustrating a method of site determination according to an exemplary embodiment.
Fig. 3 is a flow chart illustrating another method of site determination according to an exemplary embodiment.
Fig. 4 is a block diagram illustrating a site determining apparatus according to an exemplary embodiment.
Fig. 5 is a schematic diagram of an electronic device according to an exemplary embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor devices and/or microcontroller devices.
Fig. 1 shows a schematic diagram of an exemplary system architecture to which the site determination method of the embodiments of the present disclosure may be applied.
As shown in fig. 1, the system architecture may include a server 101, a network 102, and a terminal device 103. The network 102 is a medium used to provide a communication link between the terminal device 103 and the server 101. Network 102 may include various connection types such as wired, wireless communication links, or fiber optic cables, among others.
The server 101 may be a server providing various services, such as a background management server providing support for devices operated by the user with the terminal device 103. The background management server can analyze and process the received data such as the request and the like, and feed back the processing result to the terminal equipment.
The server 101 may, for example, obtain a recipient address, which includes english characters; the server 101 may split the recipient address, for example, to obtain an address keyword set, where the address keyword set includes one or more address keywords; the server 101 may, for example, query a key value table according to the address keyword, where the key value table uses one preset keyword or a combination of multiple preset keywords as a key, and uses one or multiple preset keywords or site identifiers as values; the server 101 may update the address keyword according to the address keyword and the query result if the query result includes a preset keyword, for example; the server 101 may query the key value table according to the updated address keyword, for example, to determine the destination site corresponding to the recipient address.
It should be understood that the number of terminal devices, networks and servers in fig. 1 is merely illustrative, and the server 101 may be a server of one entity, may be a server cluster formed by a plurality of servers, may be a cloud server, and may have any number of terminal devices, networks and servers according to actual needs.
The steps of the station determining method in the exemplary embodiments of the present disclosure will be described in more detail with reference to the accompanying drawings and embodiments.
Fig. 2 is a flow chart illustrating a method of site determination according to an exemplary embodiment. The method provided by the embodiments of the present disclosure may be performed in a server as shown in fig. 1, but the present disclosure is not limited thereto.
As shown in fig. 2, the station determining method provided by the embodiment of the present disclosure may include the following steps.
In step S202, a recipient address is acquired, the recipient address including english characters.
In the embodiment of the disclosure, the recipient address may be a recipient address filled in when the user places an order, and the recipient address may include english characters.
In the embodiment of the disclosure, if the initial receipt address filled in when the user places an order is a chinese address, the initial receipt address may be converted into an english receipt address first, or may be converted into a pinyin receipt address first.
For example, if the initial recipient address filled in when the user places an order is "a, b, c, cell", it may be converted to "Jia Sheng Yi Shi Bing Xiaoqu" first.
In step S204, the recipient address is split to obtain an address keyword set, where the address keyword set includes one or more address keywords.
In the embodiment of the disclosure, the recipient address can be split and matched according to English rules. For example: the recipient address is split according to space, and then the full capital words and special characters are deleted, wherein the special characters can be punctuation marks and the like.
In an exemplary embodiment, the recipient address may be split according to hump rules to obtain a set of address keywords.
The address key words obtained by splitting can be stored in an array String [ ] keywordsystem.
For example, the recipient address (i.e., the original address) is: south CarolinaMyrtle Beach4584 plants Row Way-
The separation according to the space is as follows: [ South, carolinaMyrtle, beach4584, plants, row, way- ]
The separation according to hump rule is: [ South, carolinaMyrtle, beach, plants, row, way- ]
The address keyword set is: string [ ] keywordsystemay= [ South, carolinaMyrtle, beach4584, plants, row, way- ]
For another example, the recipient address is: "Jia Sheng Yi Shi Bing Xiaoqu", the address keyword set obtained by splitting the destination address may be [ Jia, sheng, yi, shi, bing, xiaoqu ].
In an exemplary embodiment, the round robin matching may also be performed on the destination address according to a preset address length, to obtain an address keyword set.
In the embodiment of the disclosure, before the round matching of the receiving address is performed according to the preset address length, all letters in the receiving address are converted into uppercase, and then spaces and special characters in the receiving address are deleted.
The preset address length may be set according to practical situations, which is not limited in the present disclosure.
In an exemplary embodiment, the individual characters of the recipient address may be determined in turn as matching characters; sequentially and incrementally intercepting the receipt address from the matched character to obtain a target character string; and matching the target character string with the key value table to obtain an address keyword set.
For example, starting a first character of the receipt address, sequentially and progressively increasing a intercepted character string from the beginning to the end to be used as a keyword to be matched with a preset keyword in a key value table, and if the matching is successful, putting the keyword into a keyword array; if the matching fails, continuing to intercept the character string as a keyword to match with a preset keyword in the key value table until the interception is finished.
For example, the recipient address is: south CarolinaMyrtle Beach4584 plants Row Way-after converting the recipient address into uppercase and deleting spaces and special characters: SOUTHCAROLINAMYRTLEBEACHPLANTERSROWWAY
And sequentially taking S, O, U, T, H … … in the receipt address as a matching character, sequentially and progressively increasing and intercepting the receipt address from the matching character S, O, U, T, H … …, taking the matching character S as an example, intercepting target character strings as S, SO, SOU, SOUT, SOUTH … …, and matching the target character strings with preset keywords to obtain an address keyword set.
For example, the matching result obtained according to the above method is:
s (failure) →SO (failure) →SOU (failure) → … … SOUTHCAROLINA (success) … …
O (failure) →OU (failure) →OUT (failure) → … …
M (failure) →MY (failure) →MYR (failure) → … … MYRTLEBEACH (success) … …
The address keyword set is: string [ ] keywordsray= [ South Carolina, myrtle beacon ]
In step S206, a key value table is queried according to the address keywords, where the key value table uses one preset keyword or a combination of multiple preset keywords as keys and uses one or multiple preset keywords or site identifiers as values.
In the embodiment of the disclosure, one or more preset keywords can be split and bound for each target site according to the tuo address (detailed address) and the artificial judgment in the historical order.
In the embodiment of the present disclosure, the target site may be a pre-sorting site, a distribution site, a dispatch site, or the like, and in the following description, the target site is described as an example of the pre-sorting site, but the present disclosure is not limited thereto.
In the embodiment of the disclosure, before the orders are distributed, the orders can be distributed to the pre-sorting site according to the distribution address of the orders, and then each order of the pre-sorting site is distributed to the distribution address, so that the distribution efficiency can be improved.
The site identifier, the detailed address and the corresponding preset keywords of the pre-sorting site of the historical order may be as shown in table 1.
TABLE 1
For example, according to the site identification of the pre-sorted site and the corresponding preset keywords, a key value table kvMap may be constructed, where one preset keyword or a combination of multiple preset keywords is used as a key, and one or multiple preset keywords or site identifications are used as a value.
In the key value table, the site identifier corresponds to one or more preset keywords, one or more preset keywords can correspond to one or more other preset keywords, if one site identifier needs a plurality of keywords, one of the keywords is used as a key, the other keywords are used as values, various permutation and combination are generated, and if one or more keywords can be positioned to a pre-sorting site, one or more keywords are used as keys, and the site identifier of the pre-sorting site is used as a value.
For example, the receiving address structure is a & B & c|d|e, where & represents and relation, |represents or relation, and the key value table corresponding to the receiving address may be as shown in table 2.
TABLE 2
As can be seen from table 2, the values in the key table can be of two types: character types (e.g., english character types and special character types) and numeric types, wherein values for one or more preset keywords may be represented by character types and values for site identifications may be represented by numeric types.
In the embodiment of the disclosure, the address keywords in the address keyword set may be traversed, the key value table may be queried sequentially according to the address keywords, whether there is a query result corresponding to the address keywords is determined, and if there is a query result, the query result is returned.
The type of the query result can be judged, and if the query result is of a digital type (namely, the query result is a site identification), the target site can be directly returned; if the query result is a character type (english character type or special character type), the value may be parsed, and the specific process refers to step S208.
In an exemplary embodiment, if the query result is a site identifier, a site corresponding to the query result is determined to be a target site.
In step S208, if the query result includes the preset keyword, the address keyword is updated according to the address keyword and the query result.
In the embodiment of the disclosure, if the query result (i.e., the value obtained by the query) includes the preset keyword in the key value table, the key value table kvMap may be continuously queried according to the combination of the address keyword (i.e., the key value) and the query result (i.e., the value) as a new address keyword (i.e., a new key value) until the target site is obtained.
In an exemplary embodiment, if the query result is a keyword, the address keyword and the query result are connected through a preset character and then serve as updated address keywords.
For example, if the value is a single string, the current key and value may be assembled in a join as a new key.
In an exemplary embodiment, if the query result is a plurality of keywords separated by a first character, and at least one of the plurality of keywords exists in the address keyword set, the address keyword is connected with any one of the keywords in the query result through a preset character and then used as an updated address keyword.
The first character may be a character representing an "or" relationship, for example, "or" may be used.
For example, if the value is "a plurality of character strings separated", then based on "separation, it is determined whether the separated keyword exists in the keyword array; when 1 or more exist, the current key and any key are assembled into a new key with a "-" connection.
In an exemplary embodiment, if the query result is a plurality of keywords separated by the second character and the plurality of keywords are all in the address keyword set, the address keywords are connected with the plurality of keywords in the query result through the preset characters and then used as updated address keywords.
Wherein the second character may be a character representing a "and" relationship, for example "-".
For example, if the value is a plurality of strings separated by "-", then determining whether the separated keywords exist in the keyword array according to the "-" separation; when all are present, the current key and value are assembled as a new key with a "-" connection.
In step S210, the key value table is queried according to the updated address keyword to determine the destination site corresponding to the recipient address.
In the embodiment of the disclosure, the key value table kvMap can be continuously queried according to the updated address keyword, and if the obtained query result is the site identification, the target site can be directly returned; if the query result includes the preset keyword, the value may be analyzed continuously, and the specific process refers to step S208 until the target site is determined.
According to the site determining method provided by the embodiment of the disclosure, the address keyword set is obtained by splitting the destination address, and the query result is obtained according to the address keyword query key value table in the address keyword set; if the query result contains preset keywords in the key value table, updating the address keywords according to the address keywords and the query result; and continuously inquiring the key value table according to the updated address keywords until the target site corresponding to the receiving address is determined. The site determining method can be applied to a scene that the receiving address contains English characters, and can automatically, quickly and accurately determine the target site corresponding to the receiving address.
In addition, in some embodiments, the dependence on map manufacturers is replaced by an analytical matching algorithm, so that the API cost is reduced, and the accuracy of the target site is increased.
Fig. 3 is a flow chart illustrating another method of site determination according to an exemplary embodiment.
As shown in fig. 3, the station determining method provided by the embodiment of the present disclosure may include the following steps.
In step S302, the full address is split.
In the embodiment of the disclosure, the full address may be a receipt address input when the user places an order, and the receipt address may be an address represented by english characters.
The address keywords can be split and matched according to English rules, and when the split and matching fails according to English rules, the address keywords can be circularly matched according to address lengths, and the address keywords can be circularly matched by using English rules and address lengths at the same time.
The splitting of the data arrangement matching the address keywords according to the english rule may include, but is not limited to: splitting keywords according to spaces; removing the full capitalization keywords; the keywords are further split according to hump rules, and the obtained address keywords are stored as an address keyword set String [ ] keyword array.
Wherein, the data sorting splitting of the address keywords circularly matched according to the address length can comprise, but is not limited to: converting the full address into capitalization; deleting the blank space and special character in the full address; the obtained address keywords are stored as an address keyword set String [ ] keyword array.
In step S304, the address keyword is traversed.
In embodiments of the present disclosure, address keywords in the address keyword set String [ ] keyword array may be traversed.
In step S306, the key value table is queried according to the keywords.
In the embodiment of the disclosure, the key value table kvMap can be queried according to the keywords.
In step S308, it is determined whether the query result (value) is of a digital type.
In the embodiment of the present disclosure, if the value is of a digital type, step S310 is executed; if the value is not of the digital type, step S314 is performed.
In step S310, the destination site to which the number corresponds is returned.
In the embodiment of the disclosure, when the query result is of a number type, the target site corresponding to the number can be directly returned.
In step S312, the pre-sorting is successful.
In step S314, the query result (i.e., value) is parsed.
In the embodiment of the present disclosure, if the value is not of a digital type, the value may be parsed, and the specific process may include:
if the value is an individual string; or alternatively
If the value is passed, a plurality of character strings are separated, and 1 or more keywords exist in the keyword set keyword array according to the fact that the keywords are separated; or alternatively
If the value is a plurality of strings separated by "-", the keywords separated according to "-" are all present in the keyword set keyword array, step S316 is performed.
In step S316, the key and the value are spliced into a key-value as a key (key).
In the embodiment of the present disclosure, S306 may be continuously executed as a new address keyword after the address keyword and the query result are spliced until the target site is determined.
It is noted that the above-described figures are merely schematic illustrations of processes involved in a method according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily appreciated that the processes shown in the above figures do not indicate or limit the temporal order of these processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, for example, among a plurality of modules.
The following are device embodiments of the present disclosure that may be used to perform method embodiments of the present disclosure. For details not disclosed in the embodiments of the apparatus of the present disclosure, please refer to the embodiments of the method of the present disclosure.
Fig. 4 is a block diagram illustrating a site determining apparatus according to an exemplary embodiment.
As shown in fig. 4, the station determining apparatus 400 may include: a recipient address acquisition module 402, a recipient address splitting module 404, a query result acquisition module 406, an address keyword update module 408, and a site determination module 410.
The receiving address obtaining module 402 is configured to obtain a receiving address, where the receiving address includes english characters; the receiving address splitting module 404 is configured to split the receiving address to obtain an address keyword set, where the address keyword set includes one or more address keywords; the query result obtaining module 406 is configured to obtain a query result by querying a key value table according to the address keyword, where the key value table uses one preset keyword or a combination of multiple preset keywords as a key, and uses one or multiple preset keywords or site identifiers as values; the address keyword updating module 408 is configured to update the address keyword according to the address keyword and the query result if the query result includes the preset keyword; the site determining module 410 is configured to query the key value table according to the updated address keyword to determine a target site corresponding to the destination address.
In an exemplary embodiment, the address keyword update module 408 includes: and the first address keyword updating unit is used for connecting the address keyword with the query result through a preset character to be used as an updated address keyword if the query result is a keyword.
In an exemplary embodiment, the address keyword update module 408 includes: and the second address keyword updating unit is used for connecting the address keyword with any keyword in the query result through a preset character to be used as an updated address keyword if the query result is a plurality of keywords separated through a first character and at least one of the plurality of keywords exists in the address keyword set.
In an exemplary embodiment, the address keyword update module 408 includes: and the third address keyword updating unit is used for connecting the address keywords with the keywords in the query result through preset characters and then using the connected address keywords as updated address keywords if the query result is a plurality of keywords separated through second characters and the keywords are all in the address keyword set.
In an exemplary embodiment, the site determining module is further configured to determine, if the query result is the site identifier, a site corresponding to the query result as a target site.
In an exemplary embodiment, the recipient address splitting module 404 includes: the receiving address splitting unit is used for splitting the receiving address according to hump rules to obtain an address keyword set; and/or a receiving address matching unit, configured to perform cyclic matching on the receiving address, and obtain an address keyword set.
In an exemplary embodiment, the recipient address matching unit includes: a matching character determining unit, configured to sequentially determine each character of the recipient address as a matching character; the target character string intercepting unit is used for intercepting the destination address in an ascending way from the matched characters in sequence to obtain a target character string; and the address keyword obtaining unit is used for matching the target character string with the key value table to obtain the address keyword set.
It should be noted that the block diagrams shown in the above figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor devices and/or microcontroller devices.
Fig. 5 is a schematic diagram of an electronic device according to an exemplary embodiment. It should be noted that the electronic device shown in fig. 5 is only an example, and should not impose any limitation on the functions and application scope of the embodiments of the present invention.
As shown in fig. 5, the electronic device 500 includes a Central Processing Unit (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as needed so that a computer program read therefrom is mounted into the storage section 508 as needed.
In particular, according to embodiments of the present invention, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present invention 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 flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 509, and/or installed from the removable media 511. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 501.
The computer readable medium shown in the present invention 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 the context of this document, 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 the present invention, however, the computer-readable signal medium may include 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: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
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 invention. 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 or flowchart illustration, and combinations of blocks in the block diagrams 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 involved in the embodiments of the present invention may be implemented in software or in hardware. The described units may also be provided in a processor, for example, described as: a processor includes a transmitting unit, an acquiring unit, a determining unit, and a first processing unit. The names of these units do not constitute a limitation on the unit itself in some cases, and for example, the transmitting unit may also be described as "a unit that transmits a picture acquisition request to a connected server".
As another aspect, the present disclosure also provides a computer-readable storage medium that may be included in the electronic device described in the above embodiments; or may exist alone without being incorporated into the electronic device. The computer-readable storage medium carries one or more programs which, when executed by the electronic device, cause the electronic device to implement the methods described in the embodiments below. For example, the electronic device may implement the steps shown in fig. 2.
According to one aspect of the present disclosure, there is provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the methods provided in the various alternative implementations of the above-described embodiments.
It should be understood that any number of elements in the drawings of the present disclosure are for illustration and not limitation, and that any naming is used for distinction only and not for limitation.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any adaptations, uses, or adaptations of the disclosure following the general principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (10)

1. A method of site determination, comprising:
acquiring a receipt address, wherein the receipt address comprises English characters;
splitting the receipt address to obtain an address keyword set, wherein the address keyword set comprises one or more address keywords;
inquiring a key value table according to the address keywords to obtain an inquiring result, wherein one preset keyword or a plurality of preset keyword combinations are used as keys in the key value table, and one or a plurality of preset keywords or site identifiers are used as values;
if the query result contains the preset keyword, updating the address keyword according to the address keyword and the query result;
and inquiring the key value table according to the updated address keywords to determine the target site corresponding to the destination address.
2. The method of claim 1, wherein if the query result includes the preset keyword, updating the address keyword according to the address keyword and the query result comprises:
and if the query result is a keyword, connecting the address keyword with the query result through a preset character and then using the connected address keyword as an updated address keyword.
3. The method of claim 1, wherein if the query result includes the preset keyword, updating the address keyword according to the address keyword and the query result comprises:
if the query result is a plurality of keywords separated by a first character and at least one of the plurality of keywords exists in the address keyword set, connecting the address keyword with any keyword in the query result through a preset character to serve as an updated address keyword.
4. The method of claim 1, wherein if the query result includes the preset keyword, updating the address keyword according to the address keyword and the query result comprises:
if the query result is a plurality of keywords separated by the second character and the plurality of keywords exist in the address keyword set, the address keywords are connected with the plurality of keywords in the query result through preset characters and then used as updated address keywords.
5. The method of any one of claims 1-4, further comprising:
and if the query result is the site identification, determining the site corresponding to the query result as a target site.
6. The method of claim 1, wherein splitting the recipient address to obtain a set of address keywords comprises:
splitting the receiving address according to hump rules to obtain an address keyword set; and/or
And performing cyclic matching on the destination address to obtain an address keyword set.
7. The method of claim 6, wherein performing loop matching on the recipient address to obtain a set of address keywords comprises:
sequentially determining each character of the receiver address as a matching character;
sequentially and incrementally intercepting the receipt address from the matched character to obtain a target character string;
and matching the target character string with the key value table to obtain the address keyword set.
8. A station determining apparatus, comprising:
the receiving address acquisition module is used for acquiring a receiving address, and the receiving address comprises English characters;
the receiving address splitting module is used for splitting the receiving address to obtain an address keyword set, wherein the address keyword set comprises one or more address keywords;
the query result obtaining module is used for obtaining a query result according to the address keyword query key value table, wherein one preset keyword or a plurality of preset keyword combinations are used as keys in the key value table, and one or a plurality of preset keywords or site identifiers are used as values;
the address keyword updating module is used for updating the address keyword according to the address keyword and the query result if the query result contains the preset keyword;
and the site determining module is used for inquiring the key value table according to the updated address keywords so as to determine the target site corresponding to the destination address.
9. An electronic device, comprising:
at least one processor;
storage means for storing at least one program which, when executed by the at least one processor, causes the at least one processor to implement the method of any one of claims 1 to 7.
10. A computer readable storage medium having stored thereon computer executable instructions which when executed by a processor implement the method of any of claims 1 to 7.
CN202210370083.8A 2022-04-08 2022-04-08 Site determining method and related equipment Pending CN116933775A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210370083.8A CN116933775A (en) 2022-04-08 2022-04-08 Site determining method and related equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210370083.8A CN116933775A (en) 2022-04-08 2022-04-08 Site determining method and related equipment

Publications (1)

Publication Number Publication Date
CN116933775A true CN116933775A (en) 2023-10-24

Family

ID=88376292

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210370083.8A Pending CN116933775A (en) 2022-04-08 2022-04-08 Site determining method and related equipment

Country Status (1)

Country Link
CN (1) CN116933775A (en)

Similar Documents

Publication Publication Date Title
CN108733317B (en) Data storage method and device
CN111038906B (en) Order sorting method and device
CN109543154B (en) Type conversion method and device of table data, storage medium and electronic equipment
EP4116894A1 (en) Method for processing model parameters, and apparatus
CN110505289B (en) File downloading method and device, computer readable medium and wireless communication equipment
CN111125163B (en) Method and device for processing data
CN116933775A (en) Site determining method and related equipment
CN108345699B (en) Method, device and storage medium for acquiring multimedia data
CN112100168A (en) Method and device for determining data association relationship
CN112835905B (en) Array type column indexing method, device, equipment and storage medium
CN115391605A (en) Data query method, device, equipment, computer readable medium and program product
CN113094415B (en) Data extraction method, data extraction device, computer readable medium and electronic equipment
CN110033189B (en) Method, device and equipment for automatically generating fiber core segment
CN113297274A (en) Signed data query method and system
CN112749169A (en) Address tree construction method, address planning specification method, device and electronic equipment
CN111475742A (en) Address extraction method and device
CN111259121A (en) Log processing method, device, equipment and computer readable storage medium
CN112784596A (en) Method and device for identifying sensitive words
CN115994151B (en) Data request changing method, device, electronic equipment and computer readable medium
CN115129899B (en) Document tag information generation method, apparatus, device, medium, and program product
CN115374320B (en) Text matching method and device, electronic equipment and computer medium
CN110019336B (en) Method and device for querying data
CN111400322B (en) Method, apparatus, electronic device and medium for storing data
CN112115099B (en) Data normalization method, device, computer readable medium and electronic equipment
CN114492413B (en) Text proofreading 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